Central Library

Normal view MARC view ISBD view

Algorithms and Computation [electronic resource] : 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings / edited by Hee-Kap Ahn, Chan-Su Shin.

Contributor(s): Ahn, Hee-Kap [editor.] | Shin, Chan-Su [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 8889Publisher: Cham : Springer International Publishing : Imprint: Springer, 2014Description: XXII, 781 p. 144 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319130750.Subject(s): Computer science | Data structures (Computer science) | Algorithms | Computer science -- Mathematics | Computer graphics | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Computer Graphics | Data Structures | Computer Science, generalAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 Online resources: Click here to access online
Contents:
Computational geometry -- Combinatorial optimization -- Graph algorithms -- Enumeration, matching and assignment -- Data structures and algorithms -- Fixed-parameter tractable algorithms -- Scheduling algorithms -- Computational complexity -- Approximation algorithms, graph theory and algorithms -- Online and approximation algorithms -- Network and scheduling algorithms.
In: Springer eBooksSummary: This book constitutes the refereed proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, held in Jeonju, Korea, in December 2014. The 60 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 171 submissions for inclusion in the book. The focus of the volume in on the following topics: computational geometry, combinatorial optimization, graph algorithms: enumeration, matching and assignment, data structures and algorithms, fixed-parameter tractable algorithms, scheduling algorithms, computational complexity, computational complexity, approximation algorithms, graph theory and algorithms, online and approximation algorithms, and network and scheduling algorithms.
    average rating: 0.0 (0 votes)
No physical items for this record

Computational geometry -- Combinatorial optimization -- Graph algorithms -- Enumeration, matching and assignment -- Data structures and algorithms -- Fixed-parameter tractable algorithms -- Scheduling algorithms -- Computational complexity -- Approximation algorithms, graph theory and algorithms -- Online and approximation algorithms -- Network and scheduling algorithms.

This book constitutes the refereed proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, held in Jeonju, Korea, in December 2014. The 60 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 171 submissions for inclusion in the book. The focus of the volume in on the following topics: computational geometry, combinatorial optimization, graph algorithms: enumeration, matching and assignment, data structures and algorithms, fixed-parameter tractable algorithms, scheduling algorithms, computational complexity, computational complexity, approximation algorithms, graph theory and algorithms, online and approximation algorithms, and network and scheduling algorithms.

There are no comments for this item.

Log in to your account to post a comment.