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 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings / edited by Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim.
Saved in:
Bibliographic Details
Corporate Author:
SpringerLink (Online service)
Other Authors:
Serna, Maria
(Editor)
,
Shaltiel, Ronen
(Editor)
,
Jansen, Klaus
(Editor)
,
Rolim, José
(Editor)
Format:
eBook
Language:
English
Published:
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2010.
Edition:
1st ed. 2010.
Series:
Theoretical Computer Science and General Issues ;
6302
Springer eBook Collection.
Subjects:
Computer programming.
Computer communication systems.
Computers.
Algorithms.
Computer science—Mathematics.
Data structures (Computer science).
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 for the Bottleneck Asymmetric Traveling Salesman Problem
Improved Inapproximability for Submodular Maximization
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
Submodular Secretary Problem and Extensions
Approximation Algorithms for Min-Max Generalization Problems
Min-Power Strong Connectivity
The Complexity of Approximately Counting Stable Matchings
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
Approximating Linear Threshold Predicates
Approximating Sparsest Cut in Graphs of Bounded Treewidth
On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors
Vertex Sparsifiers: New Results from Old Techniques
PTAS for Weighted Set Cover on Unit Squares
Improved Lower Bounds for the Universal and a priori TSP
Proximity Algorithms for Nearly-Doubling Spaces
Matrix Sparsification and the Sparse Null Space Problem
The Checkpoint Problem
The Euclidean Distortion of Flat Tori
Online Embeddings
Approximation Algorithms for Intersection Graphs
An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs
Improved Algorithm for the Half-Disjoint Paths Problem
Approximate Lasserre Integrality Gap for Unique Games
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Maximum Flows on Disjoint Paths
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
How to Schedule When You Have to Buy Your Energy
Improving Integrality Gaps via Chvátal-Gomory Rounding
Contributed Talks of RANDOM
Uniform Derandomization from Pathetic Lower Bounds
Testing Boolean Function Isomorphism
Better Size Estimation for Sparse Matrix Products
Low Rate Is Insufficient for Local Testability
Reconstruction Threshold for the Hardcore Model
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Monotonicity Testing and Shortest-Path Routing on the Cube
Better Gap-Hamming Lower Bounds via Better Round Elimination
Propagation Connectivity of Random Hypergraphs
Improved Pseudorandom Generators for Depth 2 Circuits
The Structure of Winning Strategies in Parallel Repetition Games
Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries
Periodicity in Streams
Rumor Spreading on Random Regular Graphs and Expanders
On Testing Computability by Small Width OBDDs
Learning and Lower Bounds for AC 0 with Threshold Gates
Liftings of Tree-Structured Markov Chains
Constructive Proofs of Concentration Bounds
Almost-Euclidean Subspaces of via Tensor Products: A Simple Approach to Randomness Reduction
Testing Outerplanarity of Bounded Degree Graphs
Two-Source Extractors Secure against Quantum Adversaries
Locally Testable vs. Locally Decodable Codes
Differential Privacy and the Fat-Shattering Dimension of Linear Queries
Two Theorems on List Decoding
Delaying Satisfiability for Random 2SAT
Improved Rounding for Parallel Repeated Unique Games
A Query Efficient Non-adaptive Long Code Test with Perfect Completeness
Relativized Worlds without Worst-Case to Average-Case Reductions for NP
A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field.
Similar Items
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings
Published: (2011)
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 Pro
Published: (1999)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings
Published: (2013)
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)