Get Free Shipping on orders over $79
Approximation Algorithms for Combinatorial Optimization : Third International Workshop, APPROX 2000 Saarbr¼cken, Germany, September 5-8, 2000 Proceedings - Klaus Jansen

Approximation Algorithms for Combinatorial Optimization

Third International Workshop, APPROX 2000 Saarbr¼cken, Germany, September 5-8, 2000 Proceedings

By: Klaus Jansen (Editor), Samir Khuller (Editor)

Paperback | 12 March 2014

At a Glance

Paperback


$130.75

or 4 interest-free payments of $32.69 with

 or 

Ships in 10 to 15 business days

Invited Talks.- Approximation Algorithms That Take Advice.- Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations.- Scheduling under Uncertainty: Optimizing against a Randomizing Adversary.- Approximation Algorithms for Facility Location Problems.- Contributed Talks.- An Approximation Algorithm for MAX DICUT with Given Sizes of Parts.- Maximizing Job Benefits On-Line.- Variable Length Sequencing with Two Lengths.- Randomized Path Coloring on Binary Trees.- Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem.- Greedy Approximation Algorithms for Finding Dense Components in a Graph.- Online Real-Time Preemptive Scheduling of Jobs with Deadlines.- On the Relative Complexity of Approximate Counting Problems.- On the Hardness of Approximating NP Witnesses.- Maximum Dispersion and Geometric Maximum Weight Cliques.- New Results for Online Page Replication.- Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses.- Approximation Algorithms for a Capacitated Network Design Problem.- An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem.- Improved Approximations for Tour and Tree Covers.- Approximating Node Connectivity Problems via Set Covers.- Rectangle Tiling.- Primal-Dual Approaches to the Steiner Problem.- On the Inapproximability of Broadcasting Time.- Polynomial Time Approximation Schemes for Class-Constrained Packing Problems.- Partial Servicing of On-Line Jobs.- Factor 4/3 Approximations for Minimum 2-Connected Subgraphs.

More in Computer Programming & Software Development

Python All-in-One For Dummies : 3rd Edition - John C. Shovic

RRP $74.95

$52.47

30%
OFF
The C Programming Language : Prentice Hall Software - Brian Kernighan

RRP $107.04

$75.75

29%
OFF
Starting Out with Python : 5th Global Edition - Tony Gaddis

RRP $138.95

$108.75

22%
OFF
Web Engineering : Theory and Practice - Jeremiah Downey
The Essence of Software Engineering - Cersei Page
The Practical Guide - Kerem Koseoglu

$97.75

Practical Probabilistic Programming - Stefan Nordin