Share on TelegramApproximation, randomization, and combinatorial optimization : algorithms and techniques ; 6th International W
Author: Arora, Sanjeev Hrsg. edt, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 6 2003 Princeton, NJ (DE-601)613317742 (DE-588)16031432-X, International Workshop on Randomization and Approximation Techniques in Computer Science 7 2003 Princeton, NJ (DE-601)378290010 (DE-588)5553329-2, APPROX 2003 (6 2003.08.24-26 Princeton, NJ), International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (6 2003.08.24-26 Princeton, NJ), International Workshop on Randomization and Approximation Techniques in Computer Science (7 2003.08.24-26 Princeton, NJ), RANDOM 2003 (7 2003.08.24-26 Princeton, NJ)
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Computer algorithms Congresses, Computer science Congresses Statistical methods, Computer science Statistical methods Congresses
Publishers: Berlin [u.a.] Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540407707, 9783540407706
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 190.47 MB
PDF Size: 3.75 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 528
Views: 578
Total Files: 18
Media Type: texts
Total Files: 5
Last Modified: 2022-03-09 09:15:29
Size: 11.39 KB
Description
Author: Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-40770-6
DOI: 10.1007/b11961
Table of Contents:
- Correlation Clustering with Partial Information
- Improved Linear Time Approximation Algorithms for Weighted Matchings
- Covering Graphs Using Trees and Stars
- An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor
- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks
- Asymmetry in k-Center Variants
- An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
- On the Complexity of Approximating k-Dimensional Matching
- Approximating Market Equilibria
- Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
- On the Hardness of Approximate Multivariate Integration
- A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem
- Approximating Rooted Connectivity Augmentation Problems
- Effective Routing and Scheduling in Adversarial Queueing Networks
- Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement
- An Improved Algorithm for Approximating the Radii of Point Sets
- Testing Low-Degree Polynomials over GF(2)
- Computational Analogues of Entropy
- Bounds on 2-Query Codeword Testing
- The Lovász Number of Random Graphs
Includes bibliographical references
