Skip to content
Library Home
Start Over
Research Databases
E-Journals
Course Reserves
Library Home
Login to library account
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文(繁體)
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Language
Library Catalog
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Find
Advanced Search
|
Browse
|
Search Tips
Approximation, Randomization,...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
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 / edited by Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim.
Saved in:
Bibliographic Details
Corporate Author:
SpringerLink (Online service)
Other Authors:
Charikar, Moses
(Editor)
,
Jansen, Klaus
(Editor)
,
Reingold, Omer
(Editor)
,
Rolim, José D.P
(Editor)
Format:
eBook
Language:
English
Published:
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2007.
Edition:
1st ed. 2007.
Series:
Theoretical Computer Science and General Issues ;
4627
Springer eBook Collection.
Subjects:
Software engineering.
Algorithms.
Computer science—Mathematics.
Numerical analysis.
Electronic resources (E-books)
Online Access:
Click to view e-book
Holy Cross Note:
Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Holdings
Description
Table of Contents
Similar Items
Staff View
Table of 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.
Similar Items
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings
Published: (2005)
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA August 22-24, 2004 , Proceedings
Published: (2004)
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008
Published: (2008)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings
Published: (2006)
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, Princeto, NY, USA, August 24-26,2003
Published: (2003)