Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3484)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Buy print copy
Keywords
- Computer
- algorithm
- algorithmics
- algorithms
- approximation
- classification
- combinatorial optimization
- complexity theory
- computational complexity
- computational discrete mathematics
- computational geometry
- computer science
- data mining
- on-line algorithms
- optimization
- algorithm analysis and problem complexity
Table of contents (11 chapters)
-
Front Matter
-
Contributed Talks
-
Back Matter
Editors and Affiliations
Bibliographic Information
Book Title: Efficient Approximation and Online Algorithms
Book Subtitle: Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Editors: Evripidis Bampis, Klaus Jansen, Claire Kenyon
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/11671541
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2006
Softcover ISBN: 978-3-540-32212-2Published: 06 February 2006
eBook ISBN: 978-3-540-32213-9Published: 24 January 2006
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 348
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing, Computer Communication Networks, Computer Graphics, Algorithms