+612 9045 4394
 
CHECKOUT
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
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 Pr - Dorit Hochbaum

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 Pr

By: Dorit Hochbaum (Editor), Klaus Jansen (Editor), Jose D. P. Rolim (Editor), Alistair Sinclair (Editor)

Paperback Published: 28th July 1999
ISBN: 9783540663294
Number Of Pages: 298

Share This Book:

Paperback

$135.51
or 4 easy payments of $33.88 with Learn more
Ships in 10 to 15 business days

Earn 271 Qantas Points
on this Book

This volume contains the papers presented at the3rd International Wo- shoponRandomizationandApproximationTechniquesinComputer Science (RANDOM'99) and the 2nd International Workshop on - proximation Algorithms for Combinatorial Optimization Problems (APPROX'99), which took place concurrently at the University of California, Berkeley, from August 8-11, 1999. RANDOM'99 is concerned with appli- tions of randomness to computational and combinatorial problems, and is the third workshop in the series following Bologna (1997) and Barcelona (1998). APPROX'99 focuses on algorithmic and complexity issues surrounding the - velopment of e?cient approximate solutions to computationally hard problems, and is the second in the series after Aalborg (1998). The volume contains 24 contributed papers, selected by the two program committees from 44 submissions received in response to the call for papers, together with abstracts of invited lectures by Uri Feige (Weizmann Institute), Christos Papadimitriou (UC Berkeley), Madhu Sudan (MIT), and Avi Wigd- son (Hebrew University and IAS Princeton). We would like to thank all of the authors who submitted papers, our invited speakers, the external referees we consulted and the members of the program committees, who were: RANDOM'99 APPROX'99 Alistair Sinclair, UC Berkeley Dorit Hochbaum, UC Berkeley Noga Alon, Tel Aviv U. Sanjeev Arora, Princeton U. Jennifer Chayes, Microsoft Leslie Hall, Johns Hopkins U. Monika Henzinger, Compaq-SRC Samir Khuller, U. of Maryland Mark Jerrum, U. of Edinburgh Phil Klein, Brown U.

Session Random 1
Completeness and Robustness Properties of Min-Wise Independent Permutationsp. 1
Low Discrepancy Sets Yield Approximate Min-Wise Independentp. 11
Session Approx 1
Independent Sets in Hypergraphs with Applications to Routing via Fixed Pathsp. 16
Approximating Minimum Manhattan Networksp. 28
Approximation of Multi-color Discrepancyp. 39
A Polynomial Time Approximation Scheme for the Multiplep. 51
Session Approx 2
Set Cover with Requirements and Costs Evolving over Timep. 63
Multicoloring Planar Graphs and Partial k-Treesp. 73
Session: Random 2
Testing the Diameter of Graphsp. 85
Improved Testing Algorithms for Monotonicityp. 97
Linear Consistency Testingp. 109
Improved Bounds for Sampling Contingency Tablesp. 121
Invited Talk
Probabilistic and Deterministic Approximations of the Permanentp. 130
Session Random 3
Improved Derandomization of BPP Using a Hitting Set Generatorp. 131
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Setsp. 138
Session Approx 3
Stochastic Machine Scheduling Performance Guarantees for LP-based Priority Policiesp. 144
Efficient Redundant Assignments under Fault-Tolerance Constraintsp. 156
Scheduling with Machine Costp. 168
A Linear Time Approximation Scheme for the Job Shop Scheduling Problemp. 177
Invited Talk
Randomized Rounding for Semidefinite Programs - Variations on the MAX CUT Examplep. 189
Session Approx 4
Hardness Results for the Power Range Assignment Problem in Packet Radio Networksp. 197
A New Approximation Algorithm for the Demand Routing and Slotting Problem with Unit Demands on Ringsp. 209
Session Random 4
Algorithms for Graph Partitioning on the Planted Partition Modelp. 221
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forestp. 233
Fast Approximate PCPs for Multidimensional Bin-Packing Problemsp. 245
Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditionsp. 257
Minisymposium on Scheduling Talks
Scheduling with Unexpected Machine Breakdownsp. 269
Scheduling on a Constant Number of Machinesp. 281
Author Indexp. 289
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9783540663294
ISBN-10: 3540663290
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 298
Published: 28th July 1999
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 1.65
Weight (kg): 0.44

Earn 271 Qantas Points
on this Book