05471nam 22008175 450 99646551790331620200703181139.03-540-45753-410.1007/3-540-45753-4(CKB)1000000000211850(SSID)ssj0000321373(PQKBManifestationID)11241019(PQKBTitleCode)TC0000321373(PQKBWorkID)10264104(PQKB)10749721(DE-He213)978-3-540-45753-4(MiAaPQ)EBC3072072(PPN)155177710(EXLCZ)99100000000021185020121227d2002 u| 0engurnn|008mamaatxtccrApproximation Algorithms for Combinatorial Optimization[electronic resource] 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings /edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani1st ed. 2002.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2002.1 online resource (VIII, 276 p.) Lecture Notes in Computer Science,0302-9743 ;2462Bibliographic Level Mode of Issuance: Monograph3-540-44186-7 Includes bibliographical references and index.Search and Classification of High Dimensional Data -- Bicriteria Spanning Tree Problems -- Improved Approximation Algorithms for Multilevel Facility Location Problems -- On Constrained Hypergraph Coloring and Scheduling -- On the Power of Priority Algorithms for Facility Location and Set Cover -- Two Approximation Algorithms for 3-Cycle Covers -- Approximation Algorithms for the Unsplittable Flow Problem -- 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor -- Typical Rounding Problems -- Approximating Min-sum Set Cover -- Approximating Maximum Edge Coloring in Multigraphs -- Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees -- A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs -- Facility Location and the Geometric Minimum-Diameter Spanning Tree -- Improved Approximation Algorithms for the Partial Vertex Cover Problem -- Minimum Restricted Diameter Spanning Trees -- Hardness of Approximation for Vertex-Connectivity Network-Design Problems -- Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \[ 2^{\log } ^{^{_{^{1 - \in } } } } ^n \] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem -- Routing and Admission Control in Networks with Advance Reservations -- Improved Approximation Algorithms for Metric Facility Location Problems -- Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products -- Primal-Dual Algorithms for Connected Facility Location Problems.Lecture Notes in Computer Science,0302-9743 ;2462Computer programmingComputersMathematical optimizationAlgorithmsComputer science—MathematicsNumerical analysisProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Optimizationhttps://scigraph.springernature.com/ontologies/product-market-codes/M26008Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Numeric Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I1701XComputer programming.Computers.Mathematical optimization.Algorithms.Computer science—Mathematics.Numerical analysis.Programming Techniques.Theory of Computation.Optimization.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Numeric Computing.004/.01/51Jansen Klausedthttp://id.loc.gov/vocabulary/relators/edtLeonardi Stefanoedthttp://id.loc.gov/vocabulary/relators/edtVazirani Vijayedthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Approximation Algorithms for Combinatorial Optimization ProblemsMiAaPQMiAaPQMiAaPQBOOK996465517903316Approximation Algorithms for Combinatorial Optimization2209915UNISA