Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbr�cken, Germany, September 5-8, 2000 Proceedings

by Klaus Jansen (Editor), Samir Khuller (Editor)

Overview

This book constitutes the refereed proceedings of the Third Internatio nal Workshop on Approximation Algorithms for Combinatorial Optimizatio n Problems, APPROX 2000, held in Saarbruecken, Germany in September 20 00. The 22 revised full papers presented together with four invited co ntributions were carefully reviewed and selected from 68 submissions. The topics dealt with include design and analysis of approximation alg orithms, inapproximibility results, on-line problems, randomization te chniques, average-case analysis, approximation classes, scheduling pro blems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design , and various applications.

Product Details

ISBN-13:	9783540679967
Publisher:	Springer Berlin Heidelberg
Publication date:	10/02/2000
Series:	Lecture Notes in Computer Science , #1913
Edition description:	2000
Pages:	282
Product dimensions:	6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

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.