Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrüc
User Rating: Be the first one!
Author: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (3rd : 2000 : Saarbrücken, Germany), Jansen, Klaus, Khuller, Samir
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Computer algorithms, Approximation theory, Combinatorial optimization
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540679960
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 154.32 MB
PDF Size: 4.07 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 483
Views: 533
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 44436 X archive t...torrent
Last Modified: 2022-03-09 09:44:35
Download
Size: 10.13 KB
Description
Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings
Author: Klaus Jansen, Samir Khuller
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67996-7
DOI: 10.1007/3-540-44436-X
Table of Contents:
Includes bibliographical references and index
Author: Klaus Jansen, Samir Khuller
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67996-7
DOI: 10.1007/3-540-44436-X
Table of Contents:
- Approximation Algorithms That Take Advice
- Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations
- Scheduling under Uncertainty: Optimizing against a Randomizing Adversary
- Approximation Algorithms for Facility Location Problems
- An Approximation Algorithm for MAX DICUT with Given Sizes of Parts
- Maximizing Job Benefits On-Line
- Variable Length Sequencing with Two Lengths
- Randomized Path Coloring on Binary Trees
- Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem
- Greedy Approximation Algorithms for Finding Dense Components in a Graph
- Online Real-Time Preemptive Scheduling of Jobs with Deadlines
- On the Relative Complexity of Approximate Counting Problems
- On the Hardness of Approximating NP Witnesses
- Maximum Dispersion and Geometric Maximum Weight Cliques
- New Results for Online Page Replication
- Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses
- Approximation Algorithms for a Capacitated Network Design Problem
- An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem
- Improved Approximations for Tour and Tree Covers
- Approximating Node Connectivity Problems via Set Covers
Includes bibliographical references and index
You May Also Like
We will be happy to hear your thoughts