Blick ins Buch

Approximation Algorithms for Combinatorial Optimization

Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings

Klaus Jansen, Samir Khuller (Herausgeber)

Buch | Softcover

X, 282 Seiten

2000
Springer Berlin (Verlag)
978-3-540-67996-7 (ISBN)

Artikel merken

The Workshop on Approximation Algorithms for Combinatorial Optimization ProblemsAPPROX 2000 focuses on algorithmic and complexity aspects ar- ing in the development of e?cient approximate solutions to computationally di?cult problems. It aims, in particular, at fostering cooperation among - gorithmic and complexity researchers in the ?eld. The workshop, to be held at the Max-Planck-Institute for Computer Science in Saarbruc ken, Wermany, co-locates with ESA 2020 and WWE 2000. We would like to thank the local organizers at the Max-Planck-Institute (AG 8, Kurt Mehlhorn), for this opp- tunity. APPVOXis an annual meeting, with previousworkshopsin Aalborg and Berkeley. Previous proceedings appeared as LNCS 1464 and 1671. Topics of interest for APPROX 2000 are: design and analysis of appro- mation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routingand?owproblems,coloringandiartitioning,cutsandconnectivity,pa- ing and covering, geometric problems, network design, and various applications. The numberof submitted papersto APPROX 2000was68 fromwhich 23 paters were selected. This volume contains the selected papers plus papers by invited speakers. All papers published in the workshop proceedings nere selected by the program committee on the basis of referee reports. Each paper was reviewed vy at least three referees who judged the papers for originality, quality, and consistency with the topics of the conference.

Invited Talks.- Approximation Algorithms That Take Advice.- Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations.- Scheduling under Uncertainty: Optimizing against a Randomizing Adversary.- Approximation Algorithms for Facility Location Problems.- Contributed Talks.- An Approximation Algorithm for MAX DICUT with Given Sizes of Parts.- Maximizing Job Benefits On-Line.- Variable Length Sequencing with Two Lengths.- Randomized Path Coloring on Binary Trees.- Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem.- Greedy Approximation Algorithms for Finding Dense Components in a Graph.- Online Real-Time Preemptive Scheduling of Jobs with Deadlines.- On the Relative Complexity of Approximate Counting Problems.- On the Hardness of Approximating NP Witnesses.- Maximum Dispersion and Geometric Maximum Weight Cliques.- New Results for Online Page Replication.- Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses.- Approximation Algorithms for a Capacitated Network Design Problem.- An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem.- Improved Approximations for Tour and Tree Covers.- Approximating Node Connectivity Problems via Set Covers.- Rectangle Tiling.- Primal-Dual Approaches to the Steiner Problem.- On the Inapproximability of Broadcasting Time.- Polynomial Time Approximation Schemes for Class-Constrained Packing Problems.- Partial Servicing of On-Line Jobs.- Factor 4/3 Approximations for Minimum 2-Connected Subgraphs.

Erscheint lt. Verlag	25.8.2000
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	X, 282 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	413 g
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
Schlagworte	Algorithm analysis and problem complexity • algorithms • Approximate Solutions • Approximation • approximation algorithms • Approximation / Näherung (Mathematik) • combinatorial optimization • Complexity • Computational Geometry • Computational Graph Theory • data structures • discrete computational mathematics • Scheduling
ISBN-10	3-540-67996-0 / 3540679960
ISBN-13	978-3-540-67996-7 / 9783540679967
Zustand	Neuware