1 option
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2462.
- Lecture Notes in Computer Science, 0302-9743 ; 2462
- Language:
- English
- Subjects (All):
- Computer programming.
- Computers.
- Mathematical optimization.
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Numerical analysis.
- Programming Techniques.
- Theory of Computation.
- Optimization.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Numeric Computing.
- Local Subjects:
- Programming Techniques.
- Theory of Computation.
- Optimization.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Numeric Computing.
- Physical Description:
- 1 online resource (VIII, 276 pages).
- Edition:
- First edition 2002.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45753-4
- 9783540457534
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.