LEADER 06177nam 22008535 450 001 9910143618403321 005 20251116234122.0 010 $a3-540-44436-X 024 7 $a10.1007/3-540-44436-X 035 $a(CKB)1000000000211316 035 $a(SSID)ssj0000321372 035 $a(PQKBManifestationID)11260288 035 $a(PQKBTitleCode)TC0000321372 035 $a(PQKBWorkID)10263550 035 $a(PQKB)10971411 035 $a(DE-He213)978-3-540-44436-7 035 $a(MiAaPQ)EBC3072870 035 $a(PPN)155219820 035 $a(BIP)6779731 035 $a(EXLCZ)991000000000211316 100 $a20100301d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation Algorithms for Combinatorial Optimization $eThird International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings /$fedited by Klaus Jansen, Samir Khuller 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (X, 282 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v1913 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-67996-0 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $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. 330 $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. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v1913 606 $aComputer programming 606 $aData structures (Computer science) 606 $aInformation theory 606 $aApplication software 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer graphics 606 $aProgramming Techniques 606 $aData Structures and Information Theory 606 $aComputer and Information Systems Applications 606 $aAlgorithms 606 $aData Science 606 $aComputer Graphics 615 0$aComputer programming. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aApplication software. 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer graphics. 615 14$aProgramming Techniques. 615 24$aData Structures and Information Theory. 615 24$aComputer and Information Systems Applications. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aComputer Graphics. 676 $a004/.01/5114 702 $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKhuller$b Samir$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop on Approximation Algorithms for Combinatorial Optimization Problems 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143618403321 996 $aApproximation Algorithms for Combinatorial Optimization$92209915 997 $aUNINA