Coverart for item
The Resource Approximation, randomization, and combinatorial optimization : algorithms and techniques : 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005 : proceedings, Chandra Chekuri [and others] (eds.)

Approximation, randomization, and combinatorial optimization : algorithms and techniques : 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005 : proceedings, Chandra Chekuri [and others] (eds.)

Label
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005 : proceedings
Title
Approximation, randomization, and combinatorial optimization
Title remainder
algorithms and techniques : 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005 : proceedings
Statement of responsibility
Chandra Chekuri [and others] (eds.)
Title variation
  • APPROX 2005
  • RANDOM 2005
  • 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
  • Eighth International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
  • International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
  • 9th International Workshop on Randomization and Computation
  • Ninth International Workshop on Randomization and Computation
  • International Workshop on Randomization and Computation
Creator
Contributor
Subject
Genre
Language
eng
Summary
"This volume contains the papers presented at the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and the 9th International Workshop on Randomization and Computation (RANDOM 2005), which took place concurrently at the University of California in Berkeley, on August 22 -24, 2005."
Member of
Cataloging source
GW5XE
Dewey number
005.1
Illustrations
illustrations
Index
index present
Language note
English
LC call number
QA75.5
LC item number
.I643 2005eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2005
http://bibfra.me/vocab/lite/meetingName
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
2005
http://library.link/vocab/relatedWorkOrContributorName
  • Chekuri, Chandra
  • International Workshop on Randomization and Computation
Series statement
Lecture notes in computer science,
Series volume
3624
http://library.link/vocab/subjectName
  • Computer science
  • Computer algorithms
  • Approximation algorithms
  • Algorithmes
  • Approximation, Théorie de l'
  • Optimisation combinatoire
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • Informatique
  • Approximation algorithms
  • Computer algorithms
  • Computer science
  • Théorie de l'approximation
  • Optimisation combinatoire
  • Algorithme
  • Randomisation
Label
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005 : proceedings, Chandra Chekuri [and others] (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Contributed Talks of APPROX -- The Network as a Storage Device: Dynamic Routing with Bounded Buffers -- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT -- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs -- A Rounding Algorithm for Approximating Minimum Manhattan Networks -- Packing Element-Disjoint Steiner Trees -- Approximating the Bandwidth of Caterpillars -- Where's the Winner? Max-Finding and Sorting with Metric Costs -- What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization -- The Complexity of Making Unique Choices: Approximating 1-in-k SAT -- Approximating the Distortion -- Approximating the Best-Fit Tree Under L p Norms -- Beating a Random Assignment -- Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints -- Approximation Algorithms for Network Design and Facility Location with Service Capacities -- Finding Graph Matchings in Data Streams -- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses -- Efficient Approximation of Convex Recolorings -- Approximation Algorithms for Requirement Cut on Graphs -- Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems -- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy -- Contributed Talks of RANDOM -- Bounds for Error Reduction with Few Quantum Queries -- Sampling Bounds for Stochastic Optimization -- An Improved Analysis of Mergers -- Finding a Maximum Independent Set in a Sparse Random Graph -- On the Error Parameter of Dispersers -- Tolerant Locally Testable Codes -- A Lower Bound on List Size for List Decoding -- A Lower Bound for Distribution-Free Monotonicity Testing -- On Learning Random DNF Formulas Under the Uniform Distribution -- Derandomized Constructions of k-Wise (Almost) Independent Permutations -- Testing Periodicity -- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem -- The Online Clique Avoidance Game on Random Graphs -- A Generating Function Method for the Average-Case Analysis of DPLL -- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas -- Mixing Points on a Circle -- Derandomized Squaring of Graphs -- Tight Bounds for String Reconstruction Using Substring Queries -- Reconstructive Dispersers and Hitting Set Generators -- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable -- Fractional Decompositions of Dense Hypergraphs
Control code
262680975
Dimensions
unknown
Extent
1 online resource (xi, 493 pages)
Form of item
online
Isbn
9783540282396
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 9783540282396
  • 10.1007/11538462
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-540-28239-6
Specific material designation
remote
System control number
(OCoLC)262680975
Label
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005 : proceedings, Chandra Chekuri [and others] (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Contributed Talks of APPROX -- The Network as a Storage Device: Dynamic Routing with Bounded Buffers -- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT -- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs -- A Rounding Algorithm for Approximating Minimum Manhattan Networks -- Packing Element-Disjoint Steiner Trees -- Approximating the Bandwidth of Caterpillars -- Where's the Winner? Max-Finding and Sorting with Metric Costs -- What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization -- The Complexity of Making Unique Choices: Approximating 1-in-k SAT -- Approximating the Distortion -- Approximating the Best-Fit Tree Under L p Norms -- Beating a Random Assignment -- Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints -- Approximation Algorithms for Network Design and Facility Location with Service Capacities -- Finding Graph Matchings in Data Streams -- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses -- Efficient Approximation of Convex Recolorings -- Approximation Algorithms for Requirement Cut on Graphs -- Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems -- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy -- Contributed Talks of RANDOM -- Bounds for Error Reduction with Few Quantum Queries -- Sampling Bounds for Stochastic Optimization -- An Improved Analysis of Mergers -- Finding a Maximum Independent Set in a Sparse Random Graph -- On the Error Parameter of Dispersers -- Tolerant Locally Testable Codes -- A Lower Bound on List Size for List Decoding -- A Lower Bound for Distribution-Free Monotonicity Testing -- On Learning Random DNF Formulas Under the Uniform Distribution -- Derandomized Constructions of k-Wise (Almost) Independent Permutations -- Testing Periodicity -- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem -- The Online Clique Avoidance Game on Random Graphs -- A Generating Function Method for the Average-Case Analysis of DPLL -- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas -- Mixing Points on a Circle -- Derandomized Squaring of Graphs -- Tight Bounds for String Reconstruction Using Substring Queries -- Reconstructive Dispersers and Hitting Set Generators -- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable -- Fractional Decompositions of Dense Hypergraphs
Control code
262680975
Dimensions
unknown
Extent
1 online resource (xi, 493 pages)
Form of item
online
Isbn
9783540282396
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 9783540282396
  • 10.1007/11538462
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-540-28239-6
Specific material designation
remote
System control number
(OCoLC)262680975

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...