skip to content
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings Preview this item
ClosePreview this item
Checking...

Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings

Author: Sanjeev Arora
Publisher: Berlin ; Hong Kong : Springer, ©2003.
Series: Lecture notes in computer science, 2764.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Summary:
This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Conference papers and proceedings
Congresses
Additional Physical Format: Print version:International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (6th : 2003 : Princeton, N.J.)
0Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings
(OCoLC)52765841
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Sanjeev Arora
ISBN: 9783540451983 3540451986
OCLC Number: 57935378
Description: 1 online resource (ix, 408 pages) : illustrations.
Contents: Contributed Talks of APPROX --
Correlation Clustering with Partial Information --
Improved Linear Time Approximation Algorithms for Weighted Matchings --
Covering Graphs Using Trees and Stars --
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor --
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks --
Asymmetry in k-Center Variants --
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times --
On the Complexity of Approximating k-Dimensional Matching --
Approximating Market Equilibria --
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem --
On the Hardness of Approximate Multivariate Integration --
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem --
Approximating Rooted Connectivity Augmentation Problems --
Effective Routing and Scheduling in Adversarial Queueing Networks --
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement --
An Improved Algorithm for Approximating the Radii of Point Sets --
Contributed Talks of RANDOM --
Testing Low-Degree Polynomials over GF(2) --
Computational Analogues of Entropy --
Bounds on 2-Query Codeword Testing --
The Lovász Number of Random Graphs --
Perfectly Balanced Allocation --
On Extracting Private Randomness over a Public Channel --
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph --
The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems --
Continuous-Time Quantum Walks on the Symmetric Group --
Distribution-Free Property Testing --
On the Graph-Density of Random 0/1-Polytopes --
A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding --
Tight Bounds for Testing Bipartiteness in General Graphs --
Discrete Quantum Walks Hit Exponentially Faster --
Approximate Testing of Visual Properties --
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances --
A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries.
Series Title: Lecture notes in computer science, 2764.
Other Titles: APPROX 2003
RANDOM 2003
Responsibility: Sanjeev Arora [and others] eds.

Abstract:

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/57935378> # Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings
    a schema:MediaObject, schema:Book, schema:CreativeWork ;
    library:oclcnum "57935378" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/934444630#Place/berlin> ; # Berlin
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/934444630#Place/hong_kong> ; # Hong Kong
    schema:about <http://experiment.worldcat.org/entity/work/data/934444630#Topic/computer_algorithms> ; # Computer algorithms
    schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
    schema:about <http://id.worldcat.org/fast/872471> ; # Computer science--Statistical methods
    schema:about <http://dewey.info/class/005.1/e22/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/934444630#Topic/computer_science_statistical_methods> ; # Computer science--Statistical methods
    schema:alternateName "APPROX 2003" ;
    schema:alternateName "RANDOM 2003" ;
    schema:bookFormat schema:EBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/934444630#Meeting/international_workshop_on_randomization_and_approximation_techniques_in_computer_science_7th_2003_princeton_n_j> ; # International Workshop on Randomization and Approximation Techniques in Computer Science (7th : 2003 : Princeton, N.J.)
    schema:contributor <http://viaf.org/viaf/44992079> ; # Sanjeev Arora
    schema:copyrightYear "2003" ;
    schema:creator <http://experiment.worldcat.org/entity/work/data/934444630#Meeting/international_workshop_on_approximation_algorithms_for_combinatorial_optimization_problems_6th_2003_princeton_n_j> ; # International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (6th : 2003 : Princeton, N.J.)
    schema:datePublished "2003" ;
    schema:description "Contributed Talks of APPROX -- Correlation Clustering with Partial Information -- Improved Linear Time Approximation Algorithms for Weighted Matchings -- Covering Graphs Using Trees and Stars -- An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor -- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks -- Asymmetry in k-Center Variants -- An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times -- On the Complexity of Approximating k-Dimensional Matching -- Approximating Market Equilibria -- Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem -- On the Hardness of Approximate Multivariate Integration -- A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem -- Approximating Rooted Connectivity Augmentation Problems -- Effective Routing and Scheduling in Adversarial Queueing Networks -- Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement -- An Improved Algorithm for Approximating the Radii of Point Sets -- Contributed Talks of RANDOM -- Testing Low-Degree Polynomials over GF(2) -- Computational Analogues of Entropy -- Bounds on 2-Query Codeword Testing -- The Lovász Number of Random Graphs -- Perfectly Balanced Allocation -- On Extracting Private Randomness over a Public Channel -- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph -- The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems -- Continuous-Time Quantum Walks on the Symmetric Group -- Distribution-Free Property Testing -- On the Graph-Density of Random 0/1-Polytopes -- A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding -- Tight Bounds for Testing Bipartiteness in General Graphs -- Discrete Quantum Walks Hit Exponentially Faster -- Approximate Testing of Visual Properties -- Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances -- A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries."@en ;
    schema:description "This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/934444630> ;
    schema:genre "Electronic books"@en ;
    schema:genre "Conference papers and proceedings"@en ;
    schema:genre "Conference publication"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/52765841> ;
    schema:name "Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings"@en ;
    schema:productID "57935378" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/57935378#PublicationEvent/berlin_hong_kong_springer_2003> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/934444630#Agent/springer> ; # Springer
    schema:url <http://rave.ohiolink.edu/ebooks/ebc/10930939> ;
    schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-540-40770-6> ;
    schema:url <http://link.springer.com/10.1007/b11961> ;
    schema:url <http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0302-9743&volume=2764> ;
    schema:url <https://login.proxy.lib.strath.ac.uk/login?url=http://link.springer.com/10.1007/b11961> ;
    schema:url <http://dx.doi.org/10.1007/b11961> ;
    schema:url <http://gate.lib.buffalo.edu/login?url=https://link.springer.com/book/10.1007/b11961> ;
    schema:workExample <http://dx.doi.org/10.1007/b11961> ;
    schema:workExample <http://worldcat.org/isbn/9783540451983> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/57935378> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/934444630#Meeting/international_workshop_on_approximation_algorithms_for_combinatorial_optimization_problems_6th_2003_princeton_n_j> # International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (6th : 2003 : Princeton, N.J.)
    a bgn:Meeting, schema:Event ;
    schema:location <http://experiment.worldcat.org/entity/work/data/934444630#Place/princeton_n_j> ; # Princeton, N.J.)
    schema:name "International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (6th : 2003 : Princeton, N.J.)" ;
    .

<http://experiment.worldcat.org/entity/work/data/934444630#Meeting/international_workshop_on_randomization_and_approximation_techniques_in_computer_science_7th_2003_princeton_n_j> # International Workshop on Randomization and Approximation Techniques in Computer Science (7th : 2003 : Princeton, N.J.)
    a bgn:Meeting, schema:Event ;
    schema:location <http://experiment.worldcat.org/entity/work/data/934444630#Place/princeton_n_j> ; # Princeton, N.J.)
    schema:name "International Workshop on Randomization and Approximation Techniques in Computer Science (7th : 2003 : Princeton, N.J.)" ;
    .

<http://experiment.worldcat.org/entity/work/data/934444630#Place/princeton_n_j> # Princeton, N.J.)
    a schema:Place ;
    schema:name "Princeton, N.J.)" ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
    schema:name "Computer algorithms"@en ;
    .

<http://id.worldcat.org/fast/872471> # Computer science--Statistical methods
    a schema:Intangible ;
    schema:name "Computer science--Statistical methods"@en ;
    .

<http://link.springer.com/10.1007/b11961>
    rdfs:comment "from Springer" ;
    rdfs:comment "(Unlimited Concurrent Users)" ;
    .

<http://viaf.org/viaf/44992079> # Sanjeev Arora
    a schema:Person ;
    schema:familyName "Arora" ;
    schema:givenName "Sanjeev" ;
    schema:name "Sanjeev Arora" ;
    .

<http://worldcat.org/isbn/9783540451983>
    a schema:ProductModel ;
    schema:isbn "3540451986" ;
    schema:isbn "9783540451983" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/57935378> ; # Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings
    schema:issn "0302-9743" ;
    schema:name "Lecture notes in computer science ;" ;
    schema:name "Lecture notes in computer science," ;
    .

<http://www.worldcat.org/oclc/52765841>
    a schema:CreativeWork ;
    rdfs:label "0Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings" ;
    schema:description "Print version:International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (6th : 2003 : Princeton, N.J.)" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/57935378> ; # Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings
    .

<http://www.worldcat.org/title/-/oclc/57935378>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/57935378> ; # Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings
    schema:dateModified "2018-02-09" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.