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
Kaydedildi:
| Kurumsal yazarlar: | , |
|---|---|
| Diğer Yazarlar: | , , |
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in computer science
1671 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • 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, August 8-11, 1999, proceedings, Dorit Hochbaum ... [et al.] (eds.), 1999, Berlin, Springer, 1 vol. (IX-287 p.), Lecture notes in computer science, 3-540-66329-0 • Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques, Texte imprimé, 9783662168080 |
İçindekiler:
- 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 MultidimensionalBin-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.