Share on TelegramApproximation, randomization, and combinatorial optimization : algorithms and techniques : 4th International W
Author: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (4th : 2001 : Berkeley, Calif.), Goemans, Michel, International Workshop on Randomization and Approximation Techniques in Computer Science (5th : 2001 : Berkeley, Calif.)
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Computer science
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540424709
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 148.66 MB
PDF Size: 3.22 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
Downloads: 217
Views: 267
Total Files: 18
Media Type: texts
Total Files: 5
Last Modified: 2022-03-09 10:04:29
Size: 9.92 KB
Description
Author: Michel Goemans, Klaus Jansen, José D. P. Rolim, Luca Trevisan
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42470-3
DOI: 10.1007/3-540-44666-4
Table of Contents:
- Using Complex Semidefinite Programming for Approximating MAX E2-LIN3
- Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems
- Web Search via Hub Synthesis
- Error-Correcting Codes and Pseudorandom Projections
- Order in Pseudorandomness
- Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows
- On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
- Online Weighted Flow Time and Deadline Scheduling
- An Online Algorithm for the Postman Problem with a Small Penalty
- A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem
- Approximation Schemes for Ordered Vector Packing Problems
- Incremental Codes
- A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set
- Approximation Algorithms for Budget-Constrained Auctions
- Minimizing Average Completion of Dedicated Tasks and Interval Graphs
- A Greedy Facility Location Algorithm Analyzed Using Dual Fitting
- 0.863-Approximation Algorithm for MAX DICUT
- The Maximum Acyclic Subgraph Problem and Degree-3 Graphs
- Some Approximation Results for the Maximum Agreement Forest Problem
- Near-optimum Universal Graphs for Graphs with Bounded Degrees
Includes bibliographical references and index
