Approximation, randomization, and combinatorial optimization - Info and Reading Options

Open Data:

Title Page -- Preface -- Organization -- Table of Contents -- Contributed Talks of APPROX -- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem -- Introduction -- Preliminaries -- Algorithm -- Special Case -- Open Questions -- References -- Improved Inapproximability for Submodular Maximization -- Introduction -- Our Results -- Our Approach -- Organization -- Notation and Background -- Submodularity -- Probability -- Hardness from Pairwise Independence -- The Construction -- The Asymmetric Case -- Symmetric Functions -- Concrete Bounds -- Symmetric Functions -- Asymmetric Functions -- References -- Approximation Algorithms for the Directed k-Tour and k-Stroll Problems -- Introduction -- Approximation Algorithm for the k-Stroll Problem -- Preliminaries -- Algorithm Overview -- Computing the Entries of the Dynamic Programming Table -- Approximation Algorithm for the k-Tour Problem -- Preliminaries and Notation -- LP Rounding -- References -- Submodular Secretary Problem and Extensions -- Introduction -- The Submodular Secretary Problem -- Algorithms -- Analysis -- The Submodular Matroid Secretary Problem -- Knapsack Constraints -- The Subadditive Secretary Problem -- Hardness Result -- Algorithm -- Conclusions and Further Results -- References -- Approximation Algorithms for Min-Max Generalization Problems -- Introduction -- Problems -- Our Results and Techniques -- Min-Max Graph Partition -- A Preliminary 2-Tier Partition -- Improving the Initial 2-Tier Partition -- Analysis of Transformations -- A 2-Tier Partition on Graphs with Arbitrary Weights -- Reduction to Scheduling and the Final Partition -- Min-Max Bin Covering -- Min-Max Rectangle Tiling -- References -- Min-Power Strong Connectivity -- Introduction -- Preliminaries -- (Weighted) Min-Power Strong Connectivity

Search for “Approximation, randomization, and combinatorial optimization” downloads:

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

Borrow "Approximation, randomization, and 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: full
• Check if available: The Open Library & The Internet Archive

Find “Approximation, randomization, and combinatorial optimization” in Libraries Near You:

Read or borrow “Approximation, randomization, and combinatorial optimization” from your local library.

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