Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008988856/catalog> ?p ?o. }

• catalog abstract "The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e?cient approximate solutions to computationally d- ?cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the ?eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc ¨ ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ?ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications. The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R.".
• catalog contributor b12632954.
• catalog contributor b12632955.
• catalog contributor b12632956.
• catalog contributor b12632957.
• catalog created "2002.".
• catalog date "2002".
• catalog date "2002.".
• catalog dateCopyrighted "2002.".
• catalog description "Includes bibliographical references and index.".
• catalog description "Search and Classification of High Dimensional Data / Yuval Rabani -- Bicriteria Spanning Tree Problems / R. Ravi -- Improved Approximation Algorithms for Multilevel Facility Location Problems / Alexander Ageev -- On Constrained Hypergraph Coloring and Scheduling / Nitin Ahuja and Anand Srivastav -- On the Power of Priority Algorithms for Facility Location and Set Cover / Spyros Angelopoulos and Allan Borodin -- Two Approximation Algorithms for 3-Cycle Covers / Markus Blaser and Bodo Manthey -- Approximation Algorithms for the Unsplittable Flow Problem / Amit Chakrabarti, Chandra Chekuri, Anuptam Gupta and Amit Kumar.".
• catalog description "The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e?cient approximate solutions to computationally d- ?cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the ?eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc ¨ ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ?ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications. The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R.".
• catalog extent "viii, 269 p. :".
• catalog identifier "3540441867 (softcover : alk. paper)".
• catalog isPartOf "Lecture notes in computer science ; 2462".
• catalog issued "2002".
• catalog issued "2002.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer,".
• catalog subject "004/.01/51 21".
• catalog subject "Computational complexity.".
• catalog subject "Computer science Statistical methods Congresses.".
• catalog subject "Computer science.".
• catalog subject "Computer software.".
• catalog subject "Electronic data processing.".
• catalog subject "Operations research.".
• catalog subject "QA75.5 .I643 2002".
• catalog tableOfContents "Search and Classification of High Dimensional Data / Yuval Rabani -- Bicriteria Spanning Tree Problems / R. Ravi -- Improved Approximation Algorithms for Multilevel Facility Location Problems / Alexander Ageev -- On Constrained Hypergraph Coloring and Scheduling / Nitin Ahuja and Anand Srivastav -- On the Power of Priority Algorithms for Facility Location and Set Cover / Spyros Angelopoulos and Allan Borodin -- Two Approximation Algorithms for 3-Cycle Covers / Markus Blaser and Bodo Manthey -- Approximation Algorithms for the Unsplittable Flow Problem / Amit Chakrabarti, Chandra Chekuri, Anuptam Gupta and Amit Kumar.".
• catalog title "Approximation algorithms for combinatorial optimization : 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedings / Klaus Jansen, Stefano Leonardi, Vijay Vazirani (eds.).".
• catalog type "Conference proceedings. fast".
• catalog type "Rom (2002) swd".
• catalog type "text".