Approximation algorithms for combinatorial optimization - Info and Reading Options

Open Data:

Lecture Notes in Computer Science -- Approximation Algorithms for Combinatorial Optimization -- Copyright -- Foreword -- Contents -- 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 -- 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 -- Author Index

Search for “Approximation algorithms for combinatorial optimization” downloads:

Visit our Downloads Search page to see if downloads are available.

Borrow "Approximation algorithms for combinatorial optimization" Online:

Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.

• Is Online Borrowing Available: Yes
• Preview Status: restricted
• Check if available: The Open Library & The Internet Archive

Find “Approximation algorithms for combinatorial optimization” in Libraries Near You:

Read or borrow “Approximation algorithms for combinatorial optimization” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Approximation algorithms for combinatorial optimization” at a library near you.