Custom cover image
Custom cover image

Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, APPROX 2002 Rome, Italy, September 17–21, 2002 Proceedings / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani

By: Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Springer eBook Collection Computer Science | Lecture notes in computer science ; 2462Publisher: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2002Description: Online-RessourceISBN:
  • 9783540457534
  • 3540441867
Other title:
  • APPROX 2002
Subject(s): Genre/Form: Additional physical formats: 9783540441861 | Buchausg. u.d.T.: Approximation algorithms for combinatorial optimization. Berlin : Springer, 2002. VIII, 269 S.DDC classification:
  • 004.0151
  • 004/.01/51
  • 005.1 23
  • 005.11 23
MSC: MSC: *00B25 | 90-06 | 90C27 | 68W25RVK: RVK: SS 4800LOC classification:
  • QA76.9.A43
DOI: DOI: 10.1007/3-540-45753-4Online resources: Summary: This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002.The 20 revised full papers presented were carefully reviewed and selected from 54 submissions. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and other fieldsPPN: PPN: 1649272618Package identifier: Produktsigel: ZDB-2-BAE | ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT