×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

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 Algorit / Edition 1
     

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 Algorit / Edition 1

by Dorit Hochbaum, Klaus Jansen, Jose D.P. Rolim, Alistair Sinclair
 

ISBN-10: 3540663290

ISBN-13: 9783540663294

Pub. Date: 08/27/1999

Publisher: Springer Berlin Heidelberg

This book constitutes the refereed proceedings of the Third Internatio nal Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'99, held jointly with the Second International Worksh op on Approximation Algorithms for Combinatorial Optimization Problems , APPROX'99, in Berkeley, California in August 1999. The volume presen ts 24 revised

Overview

This book constitutes the refereed proceedings of the Third Internatio nal Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'99, held jointly with the Second International Worksh op on Approximation Algorithms for Combinatorial Optimization Problems , APPROX'99, in Berkeley, California in August 1999. The volume presen ts 24 revised full papers selected from 44 submissions and four invite d contributions. The papers present a wealth of new results and docume nt the state-of-the art in the areas covered by the workshop.

Product Details

ISBN-13:
9783540663294
Publisher:
Springer Berlin Heidelberg
Publication date:
08/27/1999
Series:
Lecture Notes in Computer Science Series , #1671
Edition description:
1999
Pages:
298
Product dimensions:
6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

Session Random 1.- Completeness and Robustness Properties of Min-Wise Independent Permutations.- Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families.- Session Approx 1.- Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths.- Approximating Minimum Manhattan Networks.- Approximation of Multi-Color Discrepancy.- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem.- Session Approx 2.- Set Cover with Requirements and Costs Evolving over Time.- Multicoloring Planar Graphs and Partialk-Trees.- Session: Random 2.- Testing the Diameter of Graphs.- Improved Testing Algorithms for Monotonicity.- Linear Consistency Testing.- Improved Bounds for Sampling Contingency Tables.- Invited Talk.- Probabilistic and Deterministic Approximations of the Permanent.- Session Random 3.- Improved Derandomization of BPP Using a Hitting Set Generator.- Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets.- Session Approx 3.- Shastic Machine Scheduling: Performance Guarantees for LP-Based Priority Policies.- Efficient Redundant Assignments under Fault-Tolerance Constraints.- Scheduling with Machine Cost.- A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.- Invited Talk.- Randomized Rounding for Semidefinite Programs – Variations on the MAX CUT Example.- Session Approx 4.- Hardness Results for the Power Range Assignment Problem in Packet Radio Networks.- A New Approximation Algorithm for the Demand Routing and Slotting Problem with Unit Demands on Rings.- Session Random 4.- Algorithms for Graph Partitioning on the Planted Partition Model.- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest.- Fast Approximate PCPs for Multidimensional Bin-Packing Problems.- Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions.- Minisymposium on Scheduling Talks.- Scheduling with Unexpected Machine Breakdowns.- Scheduling on a Constant Number of Machines.

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews