New Added

Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings

Like Score+351

Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Original Title Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Author International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (3rd : 2000 : Saarbrücken, Germany), Jansen, Klaus, Khuller, Samir
Publication date

Topics Computer algorithms, Approximation theory, Combinatorial optimization
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 Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 ProceedingsAuthor: Klaus Jansen, Samir Khuller Published by Springer Berlin Heidelberg ISBN: 978-3-540-67996-7 DOI: 10.1007/3-540-44436-XTable 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 CoversIncludes 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