Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms
Latest Publications

TOTAL DOCUMENTS

11

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540322122, 9783540322139

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_4 ◽

2006 ◽

pp. 97-134 ◽

Author(s):

Thomas Erlebach

Keyword(s):

Approximation Algorithms ◽

Disjoint Paths ◽

Edge Disjoint ◽

Unsplittable Flow

Download Full-text

A Survey of Approximation Results for Local Search Algorithms

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_2 ◽

2006 ◽

pp. 30-73 ◽

Author(s):

Eric Angel

Keyword(s):

Local Search ◽

Search Algorithms ◽

Local Search Algorithms

Download Full-text

On Approximation Algorithms for Data Mining Applications

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_1 ◽

2006 ◽

pp. 1-29 ◽

Author(s):

Foto N. Afrati

Keyword(s):

Data Mining ◽

Approximation Algorithms

Download Full-text

A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_7 ◽

2006 ◽

pp. 203-212 ◽

Author(s):

Stefano Leonardi

Keyword(s):

Parallel Machines ◽

Flow Time ◽

Time Approximation ◽

Total Flow Time

Download Full-text

The Lovász-Local-Lemma and Scheduling

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_11 ◽

2006 ◽

pp. 321-347

Author(s):

Anand Srivastav

Keyword(s):

Lovász Local Lemma ◽

Local Lemma ◽

Lovasz Local Lemma

Download Full-text

Approximation Algorithms for the k-Median Problem

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_10 ◽

2006 ◽

pp. 292-320 ◽

Author(s):

Roberto Solis-Oba

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Independence and Coloring Problems on Intersection Graphs of Disks

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_5 ◽

2006 ◽

pp. 135-155 ◽

Author(s):

Thomas Erlebach ◽

Jiří Fiala

Keyword(s):

Intersection Graphs

Download Full-text

Approximating a Class of Classification Problems

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_8 ◽

2006 ◽

pp. 213-249

Author(s):

Ioannis Milis

Keyword(s):

Classification Problems

Download Full-text

Approximation Algorithms for Path Coloring in Trees

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_3 ◽

2006 ◽

pp. 74-96 ◽

Author(s):

Ioannis Caragiannis ◽

Christos Kaklamanis ◽

Giuseppe Persiano

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_6 ◽

2006 ◽

pp. 156-202 ◽

Author(s):

Klaus Jansen

Keyword(s):

Approximation Algorithms ◽

Resource Sharing

Download Full-text