Items related to Approximation, Randomization, and Combinatorial Optimization...

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 12th International Workshop, APPROX 2009, and 13th ... CA, USA, August, 21-23, 2009, Proceedings - Softcover

 
Image Not Available

This specific ISBN edition is currently not available.

Synopsis

Contributed Talks of APPROX.- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs.- Adaptive Sampling for k-Means Clustering.- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs.- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs.- Truthful Mechanisms via Greedy Iterative Packing.- Resource Minimization Job Scheduling.- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders.- New Hardness...

(No Available Copies)

Search Books:



Create a Want

Can't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!

Create a Want

Other Popular Editions of the Same Title

Image Not Available

Featured Edition

ISBN 10:  3642036848 ISBN 13:  9783642036842
Publisher: Springer, 2009
Softcover