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 : proceedings
著者
書誌事項
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 : proceedings
（Lecture notes in computer science, 1671）
Springer, c1999
大学図書館所蔵 件 / 全37件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
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 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 Partial k-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.- Stochastic 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.
「Nielsen BookData」 より