Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications - researchr publication

researchr

You are not signed in
Sign in
Sign up

Evripidis Bampis, Klaus Jansen, Claire Kenyon, editors, Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications. Volume 3484 of Lecture Notes in Computer Science, Springer, 2006. [doi]

Abstract is missing.

On Approximation Algorithms for Data Mining ApplicationsFoto N. Afrati. 1-29 [doi]

A Survey of Approximation Results for Local Search AlgorithmsEric Angel. 30-73 [doi]

Approximation Algorithms for Path Coloring in TreesIoannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano. 74-96 [doi]

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable FlowThomas Erlebach. 97-134 [doi]

Independence and Coloring Problems on Intersection Graphs of DisksThomas Erlebach, Jirí Fiala. 135-155 [doi]

Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and ApplicationsKlaus Jansen. 156-202 [doi]

A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel MachinesStefano Leonardi. 203-212 [doi]

Approximating a Class of Classification ProblemsIoannis Milis. 213-249 [doi]

List Scheduling in Order of α-Points on a Single MachineMartin Skutella. 250-291 [doi]

Approximation Algorithms for the k-Median ProblemRoberto Solis-Oba. 292-320 [doi]

The Lovász-Local-Lemma and SchedulingAnand Srivastav. 321-347 [doi]

runs on WebDSL