1 option
Algorithms and Computation : 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings / edited by Hee-Kap Ahn, Chan-Su Shin.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 8889.
- Theoretical Computer Science and General Issues ; 8889
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Computer graphics.
- Data structures (Computer science).
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Data Structures.
- Computer Science, general.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Data Structures.
- Computer Science, general.
- Physical Description:
- 1 online resource (XXII, 781 pages) : 144 illustrations.
- Edition:
- First edition 2014.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2014.
- System Details:
- text file PDF
- Summary:
- 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-13075-0
- 9783319130750
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.