Efficient Approximation and Online Algorithms [electronic resource] : Recent Progress on Classical Combinatorial Optimization Problems and New Applications / edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon.
Contributor(s): Bampis, Evripidis [editor.]
| Jansen, Klaus [editor.] | Kenyon, Claire [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 3484Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006Edition: 1st ed. 2006.Description: VII, 349 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540322139.Subject(s): Algorithms | Computer science -- Mathematics | Discrete mathematics | Numerical analysis | Computer networks | Computer graphics | Algorithms | Discrete Mathematics in Computer Science | Numerical Analysis | Computer Communication Networks | Computer GraphicsAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online Contributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling.
There are no comments for this item.