Book Volume 1671 1999

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques

Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX’99, Berkeley, CA, USA, August 8-11, 1999.

ISBN: 978-3-540-66329-4 (Print) 978-3-540-48413-4 (Online)

Table of contents (28 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Session Random 1

    1. No Access

      Chapter

      Pages 1-10

      Completeness and Robustness Properties of Min-Wise Independent Permutations

    2. No Access

      Chapter

      Pages 11-15

      Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families

  3. Session Approx 1

    1. No Access

      Chapter

      Pages 16-27

      Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths

    2. No Access

      Chapter

      Pages 28-38

      Approximating Minimum Manhattan Networks

    3. No Access

      Chapter

      Pages 39-50

      Approximation of Multi-Color Discrepancy

    4. No Access

      Chapter

      Pages 51-62

      A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

  4. Session Approx 2

    1. No Access

      Chapter

      Pages 63-72

      Set Cover with Requirements and Costs Evolving over Time

    2. No Access

      Chapter

      Pages 73-84

      Multicoloring Planar Graphs and Partial k-Trees

  5. Session: Random 2

    1. No Access

      Chapter

      Pages 85-96

      Testing the Diameter of Graphs

    2. No Access

      Chapter

      Pages 97-108

      Improved Testing Algorithms for Monotonicity

    3. No Access

      Chapter

      Pages 109-120

      Linear Consistency Testing

    4. No Access

      Chapter

      Pages 121-129

      Improved Bounds for Sampling Contingency Tables

  6. Invited Talk

    1. No Access

      Chapter

      Pages 130-130

      Probabilistic and Deterministic Approximations of the Permanent

  7. Session Random 3

    1. No Access

      Chapter

      Pages 131-137

      Improved Derandomization of BPP Using a Hitting Set Generator

    2. No Access

      Chapter

      Pages 138-143

      Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets

  8. Session Approx 3

    1. No Access

      Chapter

      Pages 144-155

      Stochastic Machine Scheduling: Performance Guarantees for LP-Based Priority Policies

    2. No Access

      Chapter

      Pages 156-167

      Efficient Redundant Assignments under Fault-Tolerance Constraints

    3. No Access

      Chapter

      Pages 168-176

      Scheduling with Machine Cost

    4. No Access

      Chapter

      Pages 177-188

      A Linear Time Approximation Scheme for the Job Shop Scheduling Problem

  9. Invited Talk

    1. No Access

      Chapter

      Pages 189-196

      Randomized Rounding for Semidefinite Programs – Variations on the MAX CUT Example

previous Page of 2