Efficient Approximation and Online Algorithms  Recent Progress on Classical Combinatorial Optimization Problems and New Applications /  [electronic resource] : 
edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon. 
 - 1st ed. 2006. 
 - VII, 349 p.  online resource. 
 - Theoretical Computer Science and General Issues,  3484  2512-2029 ; .
 - Theoretical Computer Science and General Issues,  3484 .
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9783540322139 
<br/><br/><label>Standard No.: </label>10.1007/11671541  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.<br/>Computer science--Mathematics.<br/>Discrete mathematics.<br/>Numerical analysis.<br/>Computer networks .<br/>Computer graphics.<br/>Algorithms.<br/>Discrete Mathematics in Computer Science.<br/>Numerical Analysis.<br/>Computer Communication Networks.<br/>Computer Graphics.
<br/><br/><label>LC Class. No.: </label>QA76.9.A43 
<br/><br/><label>Dewey Class. No.: </label>518.1