LEADER 04911nam 22007815 450 001 996466354803316 005 20200701053943.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(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$b[electronic resource] $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,$x0302-9743 ;$v1913 300 $aBibliographic Level Mode of Issuance: Monograph 311 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1913 606 $aComputer programming 606 $aData structures (Computer science) 606 $aApplication software 606 $aAlgorithms 606 $aComputer graphics 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aComputer Applications$3https://scigraph.springernature.com/ontologies/product-market-codes/I23001 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputer programming. 615 0$aData structures (Computer science). 615 0$aApplication software. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 14$aProgramming Techniques. 615 24$aData Structures and Information Theory. 615 24$aComputer Applications. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 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 $a996466354803316 996 $aApproximation Algorithms for Combinatorial Optimization$92209915 997 $aUNISA