04911nam 22007815 450 99646635480331620200701053943.03-540-44436-X10.1007/3-540-44436-X(CKB)1000000000211316(SSID)ssj0000321372(PQKBManifestationID)11260288(PQKBTitleCode)TC0000321372(PQKBWorkID)10263550(PQKB)10971411(DE-He213)978-3-540-44436-7(MiAaPQ)EBC3072870(PPN)155219820(EXLCZ)99100000000021131620100301d2000 u| 0engurnn|008mamaatxtccrApproximation Algorithms for Combinatorial Optimization[electronic resource] Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings /edited by Klaus Jansen, Samir Khuller1st ed. 2000.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2000.1 online resource (X, 282 p.) Lecture Notes in Computer Science,0302-9743 ;1913Bibliographic Level Mode of Issuance: Monograph3-540-67996-0 Includes bibliographical references at the end of each chapters and index.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.Lecture Notes in Computer Science,0302-9743 ;1913Computer programmingData structures (Computer science)Application softwareAlgorithmsComputer graphicsProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Data Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Computer Applicationshttps://scigraph.springernature.com/ontologies/product-market-codes/I23001Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Computer programming.Data structures (Computer science).Application software.Algorithms.Computer graphics.Programming Techniques.Data Structures and Information Theory.Computer Applications.Algorithm Analysis and Problem Complexity.Data Structures.Computer Graphics.004/.01/5114Jansen Klausedthttp://id.loc.gov/vocabulary/relators/edtKhuller Samiredthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Approximation Algorithms for Combinatorial Optimization ProblemsMiAaPQMiAaPQMiAaPQBOOK996466354803316Approximation Algorithms for Combinatorial Optimization2209915UNISA