05059nam a22005295i 4500001001800000003000900018005001700027007001500044008004100059020001800100024003100118041000800149050001500157072001600172072002300188082001400211100002800225245022800253260006100481264006100542300003200603336002600635337002600661338003600687347002400723490005800747505160200805520154902407650002203956650004003978650002304018650002304041650001904064650003104083650002204114650004704136650002104183650002304204650001904227650006204246700002904308710003404337773002004371776003604391830005804427856004404485978-3-540-44436-7DE-He21320141014114356.0cr nn 008mamaa100301s2000 gw | s |||| 0|eng d a97835404443677 a10.1007/3-540-44436-X2doi aeng 4aQA76.9.A43 7aUMB2bicssc 7aCOM0513002bisacsh04a005.12231 aJansen, Klaus.eeditor.10aApproximation Algorithms for Combinatorial Optimizationh[electronic resource] :bThird International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings /cedited by Klaus Jansen, Samir Khuller. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2000. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2000. aX, 282 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v19130 aInvited 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. aThe 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. 0aComputer science. 0aData structures (Computer science). 0aComputer software. 0aComputer graphics. 0aCombinatorics. 0aMathematical optimization.14aComputer Science.24aAlgorithm Analysis and Problem Complexity.24aData Structures.24aComputer Graphics.24aCombinatorics.24aCalculus of Variations and Optimal Control; Optimization.1 aKhuller, Samir.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540679967 0aLecture Notes in Computer Science,x0302-9743 ;v191340uhttp://dx.doi.org/10.1007/3-540-44436-X