000857596 000__ 02710cam\a2200529Mi\4500
000857596 001__ 857596
000857596 005__ 20230306145311.0
000857596 006__ m\\\\\o\\d\\\\\\\\
000857596 007__ cr\nn\nnnunnun
000857596 008__ 181115s2018\\\\gw\\\\\\o\\\\\000\0\eng\d
000857596 019__ $$a1079058401
000857596 020__ $$a9783030046514
000857596 020__ $$a3030046516
000857596 020__ $$z9783030046507
000857596 0247_ $$a10.1007/978-3-030-04651-4$$2doi
000857596 035__ $$aSP(OCoLC)on1080602109
000857596 035__ $$aSP(OCoLC)1080602109$$z(OCoLC)1079058401
000857596 040__ $$aUPM$$beng$$cUPM$$dGW5XE$$dOCLCO$$dDKU
000857596 049__ $$aISEA
000857596 050_4 $$aQA76.9.A43
000857596 08204 $$a005.1$$223
000857596 24500 $$aCombinatorial Optimization and Applications :$$b12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings /$$cedited by Donghyun Kim, R. N. Uma, Alexander Zelikovsky.
000857596 264_1 $$aCham :$$bSpringer International Publishing :$$bImprint: Springer,$$c2018.
000857596 300__ $$a1 online resource (xiii, 756 pages) :$$billustrations.
000857596 336__ $$atext$$btxt$$2rdacontent
000857596 337__ $$acomputer$$bc$$2rdamedia
000857596 338__ $$aonline resource$$bcr$$2rdacarrier
000857596 347__ $$atext file$$bPDF$$2rda
000857596 4901_ $$aTheoretical Computer Science and General Issues ;$$v11346
000857596 5050_ $$aGraph Theory -- Network Flow and Security -- Combinatorial Optimization -- Computational Geometry -- Combinatorial Optimization -- Combinatorial Optimization and Data Structure -- Clustering.
000857596 506__ $$aAccess limited to authorized users.
000857596 520__ $$aThe conference proceeding LNCS 11346 constitutes the refereed proceedings of the 12th International Conference on Combinatorial Optimization and Applications, COCOA 2018, held in Atlanta, GA, USA, in December 2018. The 50 full papers presented were carefully reviewed and selected from 106 submissions. The papers cover most aspects of t graph algorithms, routing and network design problems, scheduling algorithms, network optimization, combinatorial algorithms, approximation algorithms, paths and connectivity problems and much more. 
000857596 650_0 $$aComputer software.
000857596 650_0 $$aComputational complexity.
000857596 650_0 $$aElectronic data processing.
000857596 650_0 $$aComputer science.
000857596 650_0 $$aData structures (Computer scienc.
000857596 650_0 $$aComputer network architectures.
000857596 7001_ $$aKim, Donghyun.$$eeditor.
000857596 7001_ $$aUma, R. N.$$eeditor.
000857596 7001_ $$aZelikovsky, Alexander.$$eeditor.
000857596 77608 $$iPrint version: $$z9783030046507
000857596 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues ;$$v11346.
000857596 852__ $$bebk
000857596 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-04651-4$$zOnline Access$$91397441.1
000857596 909CO $$ooai:library.usi.edu:857596$$pGLOBAL_SET
000857596 980__ $$aEBOOK
000857596 980__ $$aBIB
000857596 982__ $$aEbook
000857596 983__ $$aOnline
000857596 994__ $$a92$$bISE