Algorithms and Computation

Chan-Su Shin

ISBN 10: 3319130749 / ISBN 13: 9783319130743

Published by Springer International Publishing Nov 2014, 2014

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 804 pp. Englisch.

Seller Inventory # 9783319130743

Bibliographic Details

• Title: Algorithms and Computation
• Publisher: Springer International Publishing Nov 2014
• Publication Date: 2014
• Language: English
• ISBN 10: 3319130749
• ISBN 13: 9783319130743
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 43D millimeters 235 millimeters width by 155 millimeters height by 43 millimeters depth
• Weight: 1194 grams

About this title

Synopsis

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.