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
Bewaard in:
| Coauteurs: | , |
|---|---|
| Andere auteurs: | , , |
| Formaat: | Livre numérique |
| Taal: | Anglais |
| Gepubliceerd in: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Reeks: | Lecture notes in computer science
1671 |
| Onderwerpen: | |
| Online toegang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Opmerking: |
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 |
| LEADER | 05339nam a22004577a 4500 | ||
|---|---|---|---|
| 001 | 971685 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155211137 | ||
| 020 | |a 9783540484134 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International workshop on randomization and approximation techniques in computer science |n (03 |d :1999 |c :Berkeley, Calif.). | |
| 245 | 1 | 0 | |a Randomization, approximation, and combinatorial optimization : |b 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 |c [edited by] Dorit S. Hochbaum, Klaus Jansen, José D. P. Rolim... [et al.]. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1671 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Optimisation combinatoire | ||
| 650 | |a Algorithmes | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Méthodes statistiques | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Calcul des variations | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Jansen, Klaus, |d 1961- |4 pbd | |
| 700 | 1 | |a Hochbaum, Dorit S. |4 pbd | |
| 700 | 1 | |a Rolim, José D. P., |d 1956- |4 pbd | |
| 711 | 2 | |a International workshop on approximation algorithms for combinatorial optimization problems |n (02 |d :1999 |c :Berkeley, Calif.). |4 aut | |
| 776 | 0 | |0 046437371 |t Randomization, approximation, and combinatorial optimization |o algorithms and techniques |o 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 |f Dorit Hochbaum ... [et al.] (eds.) |d 1999 |c Berlin |n Springer |p 1 vol. (IX-287 p.) |s Lecture notes in computer science |z 3-540-66329-0 | |
| 776 | 0 | |t Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques |b Texte imprimé |z 9783662168080 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b72324 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-3GZ4HL6Z-W |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750649860 |u https://ezproxy.univ-orleans.fr/login?url=https://doi |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754000370 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi |z Accès INSA CVL | |
| 997 | |0 971685 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||