FEEDBACK Smiley face
Normal view MARC view ISBD view

Efficient Approximation and Online Algorithms [electronic resource] :Recent Progress on Classical Combinatorial Optimization Problems and New Applications /

Contributor(s): Bampis, Evripidis [editor.] | Jansen, Klaus [editor.] | Kenyon, Claire [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 3484Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.Description: VII, 349 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540322139.Subject(s): Computer science | Computer communication systems | Algorithms | Numerical analysis | Computer science -- Mathematics | Computer graphics | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Numeric Computing | Computer Communication Networks | Computer Graphics | AlgorithmsOnline resources: Click here to access online
Contents:
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in