Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 12th International Workshop, APPROX 2009, and 13th Internatio [Paperback]
Notes: Brand New Item. Not shipped to AK, HI, APO, FPO, AE.
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 Results for Diophantine Approximation.- PASS Approximation.- Optimal Sherali-Adams Gaps from Pairwise Independence.- An Approximation Scheme for Terrain Guarding.- Scheduling with Outliers.- Improved Inapproximability Results for Maximum k-Colorable Subgraph.- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.- On the Optimality of Gluing over Scales.- On Hardness of Pricing Items for Single-Minded Bidders.- Real-Time Message Routing and Scheduling.- Approximating Some Network Design Problems with Node Costs.- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy.- Minimizing Average Shortest Path Distances via Shortcut Edge Addition.- Approximating Node-Connectivity Augmentation Problems.- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs.- On the Complexity of the Asymmetric VPN Problem.- Contributed Talks of RANDOM.- Deterministic Approximation Algorithms for the Nearest Codeword Problem.- Strong Parallel Repetition Theorem for Free Projection Games.- Random Low Degree Polynomials are Hard to Approximate.- Composition of Semi-LTCs by Two-Wise Tensor Products.- On the Security of Goldreichs One-Way Function.- Random Tensors and Planted Cliques.- Sampling s-Concave Functions: The Limit of Colă5
![Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 12th International Workshop, APPROX 2009, and 13th Internatio [Paperback]](/itemImage/2/6/1/2/2_5259212.jpg "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 12th International Workshop, APPROX 2009, and 13th Internatio [Paperback]")