New Added

Approximation, randomization, and combinatorial optimization : algorithms and techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 2001, proceedings

Like Score+172

Approximation, randomization, and combinatorial optimization : algorithms and techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 2001, proceedings
Original Title Approximation, randomization, and combinatorial optimization : algorithms and techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 2001, proceedings
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.)
Publication date

Topics Computer science
Publisher Berlin , New York : Springer
Collection folkscanomy_miscellaneous, folkscanomy, additional_collections
Language English
Book Type EBook
Material Type Book
File Type PDF
Downloadable Yes
Support Mobile, Desktop, Tablet
Scan Quality: Best No watermark
PDF Quality: Good
Availability Yes
Price 0.00
Submitted By
Sketch the Cow
Submit Date
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques: 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18–20, 2001 ProceedingsAuthor: 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-4Table 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 DegreesIncludes bibliographical references and index
We will be happy to hear your thoughts

Leave a reply

eBookmela
Logo
Register New Account
Reset Password
Compare items
  • Total (0)
Compare
0