Conferences in DBLP

Approximation Algorithms for Combinatorial Optimization (APPROX) (approx)
2010 (conf/approx/2010)

1. 
   Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. [Citation Graph (, )][DBLP]
   
   
2. 
   Improved Inapproximability for Submodular Maximization. [Citation Graph (, )][DBLP]
   
   
3. 
   Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. [Citation Graph (, )][DBLP]
   
   
4. 
   Submodular Secretary Problem and Extensions. [Citation Graph (, )][DBLP]
   
   
5. 
   Approximation Algorithms for Min-Max Generalization Problems. [Citation Graph (, )][DBLP]
   
   
6. 
   Min-Power Strong Connectivity. [Citation Graph (, )][DBLP]
   
   
7. 
   The Complexity of Approximately Counting Stable Matchings. [Citation Graph (, )][DBLP]
   
   
8. 
   Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   Approximating Linear Threshold Predicates. [Citation Graph (, )][DBLP]
   
   
10. 
    Approximating Sparsest Cut in Graphs of Bounded Treewidth. [Citation Graph (, )][DBLP]
    
    
11. 
    On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors. [Citation Graph (, )][DBLP]
    
    
12. 
    Vertex Sparsifiers: New Results from Old Techniques. [Citation Graph (, )][DBLP]
    
    
13. 
    PTAS for Weighted Set Cover on Unit Squares. [Citation Graph (, )][DBLP]
    
    
14. 
    Improved Lower Bounds for the Universal and a priori TSP. [Citation Graph (, )][DBLP]
    
    
15. 
    Proximity Algorithms for Nearly-Doubling Spaces. [Citation Graph (, )][DBLP]
    
    
16. 
    Matrix Sparsification and the Sparse Null Space Problem. [Citation Graph (, )][DBLP]
    
    
17. 
    The Checkpoint Problem. [Citation Graph (, )][DBLP]
    
    
18. 
    The Euclidean Distortion of Flat Tori. [Citation Graph (, )][DBLP]
    
    
19. 
    Online Embeddings. [Citation Graph (, )][DBLP]
    
    
20. 
    Approximation Algorithms for Intersection Graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs. [Citation Graph (, )][DBLP]
    
    
22. 
    Improved Algorithm for the Half-Disjoint Paths Problem. [Citation Graph (, )][DBLP]
    
    
23. 
    Approximate Lasserre Integrality Gap for Unique Games. [Citation Graph (, )][DBLP]
    
    
24. 
    Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses. [Citation Graph (, )][DBLP]
    
    
25. 
    Maximum Flows on Disjoint Paths. [Citation Graph (, )][DBLP]
    
    
26. 
    Approximation Algorithms for Reliable Stochastic Combinatorial Optimization. [Citation Graph (, )][DBLP]
    
    
27. 
    How to Schedule When You Have to Buy Your Energy. [Citation Graph (, )][DBLP]
    
    
28. 
    Improving Integrality Gaps via Chvátal-Gomory Rounding. [Citation Graph (, )][DBLP]
    
    
29. 
    Uniform Derandomization from Pathetic Lower Bounds. [Citation Graph (, )][DBLP]
    
    
30. 
    Testing Boolean Function Isomorphism. [Citation Graph (, )][DBLP]
    
    
31. 
    Better Size Estimation for Sparse Matrix Products. [Citation Graph (, )][DBLP]
    
    
32. 
    Low Rate Is Insufficient for Local Testability. [Citation Graph (, )][DBLP]
    
    
33. 
    Reconstruction Threshold for the Hardcore Model. [Citation Graph (, )][DBLP]
    
    
34. 
    Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. [Citation Graph (, )][DBLP]
    
    
35. 
    Monotonicity Testing and Shortest-Path Routing on the Cube. [Citation Graph (, )][DBLP]
    
    
36. 
    Better Gap-Hamming Lower Bounds via Better Round Elimination. [Citation Graph (, )][DBLP]
    
    
37. 
    Propagation Connectivity of Random Hypergraphs. [Citation Graph (, )][DBLP]
    
    
38. 
    Improved Pseudorandom Generators for Depth 2 Circuits. [Citation Graph (, )][DBLP]
    
    
39. 
    The Structure of Winning Strategies in Parallel Repetition Games. [Citation Graph (, )][DBLP]
    
    
40. 
    Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries. [Citation Graph (, )][DBLP]
    
    
41. 
    Periodicity in Streams. [Citation Graph (, )][DBLP]
    
    
42. 
    Rumor Spreading on Random Regular Graphs and Expanders. [Citation Graph (, )][DBLP]
    
    
43. 
    On Testing Computability by Small Width OBDDs. [Citation Graph (, )][DBLP]
    
    
44. 
    Learning and Lower Bounds for AC⁰ with Threshold Gates. [Citation Graph (, )][DBLP]
    
    
45. 
    Liftings of Tree-Structured Markov Chains - (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
46. 
    Constructive Proofs of Concentration Bounds. [Citation Graph (, )][DBLP]
    
    
47. 
    Almost-Euclidean Subspaces of l₁^N\ell_1^N via Tensor Products: A Simple Approach to Randomness Reduction. [Citation Graph (, )][DBLP]
    
    
48. 
    Testing Outerplanarity of Bounded Degree Graphs. [Citation Graph (, )][DBLP]
    
    
49. 
    Two-Source Extractors Secure against Quantum Adversaries. [Citation Graph (, )][DBLP]
    
    
50. 
    Locally Testable vs. Locally Decodable Codes. [Citation Graph (, )][DBLP]
    
    
51. 
    Differential Privacy and the Fat-Shattering Dimension of Linear Queries. [Citation Graph (, )][DBLP]
    
    
52. 
    Two Theorems on List Decoding - (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
53. 
    Delaying Satisfiability for Random 2SAT. [Citation Graph (, )][DBLP]
    
    
54. 
    Improved Rounding for Parallel Repeated Unique Games. [Citation Graph (, )][DBLP]
    
    
55. 
    A Query Efficient Non-adaptive Long Code Test with Perfect Completeness. [Citation Graph (, )][DBLP]
    
    
56. 
    Relativized Worlds without Worst-Case to Average-Case Reductions for NP. [Citation Graph (, )][DBLP]
    
    
57. 
    A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field. [Citation Graph (, )][DBLP]