skip to content
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007 : proceedings Preview this item
ClosePreview this item
Checking...

Approximation, randomization, and combinatorial optimization : algorithms and techniques : 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007 : proceedings

Author: Moses Charikar
Publisher: Berlin ; New York : Springer, 2007.
Series: Lecture notes in computer science, 4627.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Database:WorldCat
Summary:
This book constitutes the joint refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and the 11th International Workshop on Randomization and Computation, RANDOM 2007, held in Princeton, NJ, USA, in August 2007. The 44 revised full papers presented were carefully reviewed and selected from 99 submissions. Topics of interest covered  Read more...
Rating:

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

Subjects
More like this

 

Find a copy online

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 (10th : 2007 : Princeton, N.J.).
Approximation, randomization, and combinatorial optimization.
Berlin ; New York : Springer, ©2007
(OCoLC)164113364
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Moses Charikar
ISBN: 9783540742074 3540742077 3540742085 9783540742081
OCLC Number: 170926698
Notes: International conference proceedings.
Title from title screen (viewed Sept. 11, 2007).
Description: 1 online resource (xii, 626 pages).
Contents: Contributed Talks of APPROX --
Approximation Algorithms and Hardness for Domination with Propagation --
A Knapsack Secretary Problem with Applications --
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem --
Improved Approximation Algorithms for the Spanning Star Forest Problem --
Packing and Covering?-Hyperbolic Spaces by Balls --
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems --
Two Randomized Mechanisms for Combinatorial Auctions --
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs --
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows --
Stochastic Steiner Tree with Non-uniform Inflation --
On the Approximation Resistance of a Random Predicate --
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to?1 Embeddability of Negative Type Metrics --
Optimal Resource Augmentations for Online Knapsack --
Soft Edge Coloring --
Approximation Algorithms for the Max-Min Allocation Problem --
Hardness of Embedding Metric Spaces of Equal Size --
Coarse Differentiation and Multi-flows in Planar Graphs --
Maximum Gradient Embeddings and Monotone Clustering --
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems --
Encouraging Cooperation in Sharing Supermodular Costs --
Almost Exact Matchings --
Contributed Talks of RANDOM --
On Approximating the Average Distance Between Points --
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR --
A Sequential Algorithm for Generating Random Graphs --
Local Limit Theorems for the Giant Component of Random Hypergraphs --
Derandomization of Euclidean Random Walks --
High Entropy Random Selection Protocols --
Testing st-Connectivity --
Properly 2-Colouring Linear Hypergraphs --
Random Subsets of the Interval and P2P Protocols --
The Cover Time of Random Digraphs --
Eigenvectors of Random Graphs: Nodal Domains --
Lower Bounds for Swapping Arthur and Merlin --
Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects --
On Estimating Frequency Moments of Data Streams --
Distribution-Free Testing Lower Bounds for Basic Boolean Functions --
On the Randomness Complexity of Property Testing --
On the Benefits of Adaptivity in Property Testing of Dense Graphs --
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours --
Better Binary List-Decodable Codes Via Multilevel Concatenation --
Worst-Case to Average-Case Reductions Revisited --
On Finding Frequent Elements in a Data Stream --
Implementing Huge Sparse Random Graphs --
Sublinear Algorithms for Approximating String Compressibility.
Series Title: Lecture notes in computer science, 4627.
Other Titles: APPROX 2007
RANDOM 2007
Responsibility: Moses Charikar [and others] (eds.).

Abstract:

Comprising the joint proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and the 11th International Workshop on  Read more...

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/170926698> # Approximation, randomization, and combinatorial optimization : algorithms and techniques : 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007 : proceedings
    a schema:CreativeWork, schema:MediaObject, schema:Book ;
    library:oclcnum "170926698" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/865028771#Place/berlin> ; # Berlin
    schema:about <http://experiment.worldcat.org/entity/work/data/865028771#Topic/computer_science_statistical_methods> ; # Computer science--Statistical methods
    schema:about <http://dewey.info/class/005.1/e22/> ;
    schema:about <http://id.worldcat.org/fast/872471> ; # Computer science--Statistical methods
    schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/865028771#Topic/computer_algorithms> ; # Computer algorithms
    schema:alternateName "APPROX 2007" ;
    schema:alternateName "RANDOM 2007" ;
    schema:bookFormat schema:EBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/865028771#Meeting/international_workshop_on_randomization_and_computation_11th_2007_princeton_n_j> ; # International Workshop on Randomization and Computation (11th : 2007 : Princeton, N.J.)
    schema:contributor <http://experiment.worldcat.org/entity/work/data/865028771#Person/charikar_moses> ; # Moses Charikar
    schema:creator <http://experiment.worldcat.org/entity/work/data/865028771#Meeting/international_workshop_on_approximation_algorithms_for_combinatorial_optimization_problems_10th_2007_princeton_n_j> ; # International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (10th : 2007 : Princeton, N.J.)
    schema:datePublished "2007" ;
    schema:description "This book constitutes the joint refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and the 11th International Workshop on Randomization and Computation, RANDOM 2007, held in Princeton, NJ, USA, in August 2007. The 44 revised full papers presented were carefully reviewed and selected from 99 submissions. Topics of interest covered by the papers are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of approximation and randomness."@en ;
    schema:description "Contributed Talks of APPROX -- Approximation Algorithms and Hardness for Domination with Propagation -- A Knapsack Secretary Problem with Applications -- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem -- Improved Approximation Algorithms for the Spanning Star Forest Problem -- Packing and Covering?-Hyperbolic Spaces by Balls -- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems -- Two Randomized Mechanisms for Combinatorial Auctions -- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs -- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows -- Stochastic Steiner Tree with Non-uniform Inflation -- On the Approximation Resistance of a Random Predicate -- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to?1 Embeddability of Negative Type Metrics -- Optimal Resource Augmentations for Online Knapsack -- Soft Edge Coloring -- Approximation Algorithms for the Max-Min Allocation Problem -- Hardness of Embedding Metric Spaces of Equal Size -- Coarse Differentiation and Multi-flows in Planar Graphs -- Maximum Gradient Embeddings and Monotone Clustering -- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems -- Encouraging Cooperation in Sharing Supermodular Costs -- Almost Exact Matchings -- Contributed Talks of RANDOM -- On Approximating the Average Distance Between Points -- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR -- A Sequential Algorithm for Generating Random Graphs -- Local Limit Theorems for the Giant Component of Random Hypergraphs -- Derandomization of Euclidean Random Walks -- High Entropy Random Selection Protocols -- Testing st-Connectivity -- Properly 2-Colouring Linear Hypergraphs -- Random Subsets of the Interval and P2P Protocols -- The Cover Time of Random Digraphs -- Eigenvectors of Random Graphs: Nodal Domains -- Lower Bounds for Swapping Arthur and Merlin -- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects -- On Estimating Frequency Moments of Data Streams -- Distribution-Free Testing Lower Bounds for Basic Boolean Functions -- On the Randomness Complexity of Property Testing -- On the Benefits of Adaptivity in Property Testing of Dense Graphs -- Slow Mixing of Markov Chains Using Fault Lines and Fat Contours -- Better Binary List-Decodable Codes Via Multilevel Concatenation -- Worst-Case to Average-Case Reductions Revisited -- On Finding Frequent Elements in a Data Stream -- Implementing Huge Sparse Random Graphs -- Sublinear Algorithms for Approximating String Compressibility."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/865028771> ;
    schema:genre "Electronic books"@en ;
    schema:genre "Conference publication"@en ;
    schema:genre "Conference papers and proceedings"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/164113364> ;
    schema:name "Approximation, randomization, and combinatorial optimization : algorithms and techniques : 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007 : proceedings"@en ;
    schema:productID "170926698" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/170926698#PublicationEvent/berlin_new_york_springer_2007> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/865028771#Agent/springer> ; # Springer
    schema:url <http://springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=4627> ;
    schema:url <http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-74207-4> ;
    schema:url <http://site.ebrary.com/id/10258032> ;
    schema:url <http://books.scholarsportal.info/viewdoc.html?id=/ebooks/ebooks0/springer/2010-04-28/1/9783540742081> ;
    schema:url <http://www.myilibrary.com?id=135350> ;
    schema:url <http://rave.ohiolink.edu/ebooks/ebc/9783540742081> ;
    schema:url <http://dx.doi.org/10.1007/978-3-540-74208-1> ;
    schema:workExample <http://worldcat.org/isbn/9783540742074> ;
    schema:workExample <http://worldcat.org/isbn/9783540742081> ;
    umbel:isLike <http://d-nb.info/> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/170926698> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

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

<http://experiment.worldcat.org/entity/work/data/865028771#Meeting/international_workshop_on_randomization_and_computation_11th_2007_princeton_n_j> # International Workshop on Randomization and Computation (11th : 2007 : Princeton, N.J.)
    a bgn:Meeting, schema:Event ;
    schema:location <http://experiment.worldcat.org/entity/work/data/865028771#Place/princeton_n_j> ; # Princeton, N.J.)
    schema:name "International Workshop on Randomization and Computation (11th : 2007 : Princeton, N.J.)" ;
    .

<http://experiment.worldcat.org/entity/work/data/865028771#Person/charikar_moses> # Moses Charikar
    a schema:Person ;
    schema:familyName "Charikar" ;
    schema:givenName "Moses" ;
    schema:name "Moses Charikar" ;
    .

<http://experiment.worldcat.org/entity/work/data/865028771#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://worldcat.org/isbn/9783540742074>
    a schema:ProductModel ;
    schema:isbn "3540742077" ;
    schema:isbn "9783540742074" ;
    .

<http://worldcat.org/isbn/9783540742081>
    a schema:ProductModel ;
    schema:isbn "3540742085" ;
    schema:isbn "9783540742081" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/170926698> ; # Approximation, randomization, and combinatorial optimization : algorithms and techniques : 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007 : proceedings
    schema:issn "0302-9743" ;
    schema:name "Lecture notes in computer science ;" ;
    schema:name "Lecture notes in computer science," ;
    .

<http://www.worldcat.org/oclc/164113364>
    a schema:CreativeWork ;
    rdfs:label "Approximation, randomization, and combinatorial optimization." ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/170926698> ; # Approximation, randomization, and combinatorial optimization : algorithms and techniques : 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007 : proceedings
    .

<http://www.worldcat.org/title/-/oclc/170926698>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/170926698> ; # Approximation, randomization, and combinatorial optimization : algorithms and techniques : 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007 : proceedings
    schema:dateModified "2016-11-10" ;
    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.