Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3122)
Conference series link(s): APPROX: International Workshop on Approximation Algorithms for Combinatorial Optimization, RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science
Conference proceedings info: APPROX 2004, RANDOM 2004.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (37 papers)
-
Front Matter
-
Contributed Talks of APPROX
Other Volumes
-
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Keywords
- algorithms
- approximation
- approximation algorithms
- coding
- combinatorial optimization
- complexity
- complexity theory
- computational discrete mathematics
- computational graph theory
- derandomization
- game theory
- online algorithms
- optimization
- randomization
- randomized algorithms
- algorithm analysis and problem complexity
Editors and Affiliations
-
Institute for Computer Science, University of Kiel, Kiel, Germany
Klaus Jansen
-
Dept. of CIS, Univ. of Pennsylvania, Philadelphia
Sanjeev Khanna
-
Centre Universitaire d’Informatique, Carouge, Switzerland
José D. P. Rolim
-
Tel-Aviv University, Ramat Aviv, Israel
Dana Ron
Bibliographic Information
Book Title: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Book Subtitle: 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA August 22-24, 2004 , Proceedings
Editors: Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b99805
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2004
Softcover ISBN: 978-3-540-22894-3Published: 11 August 2004
eBook ISBN: 978-3-540-27821-4Published: 20 October 2004
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 434
Topics: Theory of Computation, Computer Science, general, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing, Algorithms