Combinatorial Optimization and Applications [electronic resource] : 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II / edited by Xiaofeng Gao, Hongwei Du, Meng Han.
Contributor(s): Gao, Xiaofeng [editor.] | Du, Hongwei [editor.] | Han, Meng [editor.] | SpringerLink (Online service).
Material type: BookSeries: Theoretical Computer Science and General Issues: 10628Publisher: Cham : Springer International Publishing : Imprint: Springer, 2017Edition: 1st ed. 2017.Description: XVIII, 529 p. 88 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319711478.Subject(s): Algorithms | Computer science -- Mathematics | Discrete mathematics | Numerical analysis | Artificial intelligence -- Data processing | Computer networks | Software engineering | Algorithms | Discrete Mathematics in Computer Science | Numerical Analysis | Data Science | Computer Communication Networks | Software EngineeringAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online In: Springer Nature eBookSummary: The two-volume set LNCS 10627 and 10628 constitutes the refereed proceedings of the 11th International Conference on Combinatorial Optimization and Applications, COCOA 2017, held in Shanghai, China, in December 2017. The 59 full papers and 19 short papers presented were carefully reviewed and selected from 145 submissions. The papers cover most aspects of theoretical computer science and combinatorics related to computing, including classic combinatorial optimization, geometric optimization, complexity and data structures, and graph theory. They are organized in topical sections on network, approximation algorithm and graph theory, combinatorial optimization, game theory, and applications.The two-volume set LNCS 10627 and 10628 constitutes the refereed proceedings of the 11th International Conference on Combinatorial Optimization and Applications, COCOA 2017, held in Shanghai, China, in December 2017. The 59 full papers and 19 short papers presented were carefully reviewed and selected from 145 submissions. The papers cover most aspects of theoretical computer science and combinatorics related to computing, including classic combinatorial optimization, geometric optimization, complexity and data structures, and graph theory. They are organized in topical sections on network, approximation algorithm and graph theory, combinatorial optimization, game theory, and applications.
There are no comments for this item.