The SCEAS System
Navigation Menu

Conferences in DBLP

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


  1. Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. [Citation Graph (, )][DBLP]


  2. Adaptive Sampling for k-Means Clustering. [Citation Graph (, )][DBLP]


  3. Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs. [Citation Graph (, )][DBLP]


  4. Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. [Citation Graph (, )][DBLP]


  5. Truthful Mechanisms via Greedy Iterative Packing. [Citation Graph (, )][DBLP]


  6. Resource Minimization Job Scheduling. [Citation Graph (, )][DBLP]


  7. The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. [Citation Graph (, )][DBLP]


  8. New Hardness Results for Diophantine Approximation. [Citation Graph (, )][DBLP]


  9. PASS Approximation. [Citation Graph (, )][DBLP]


  10. Optimal Sherali-Adams Gaps from Pairwise Independence. [Citation Graph (, )][DBLP]


  11. An Approximation Scheme for Terrain Guarding. [Citation Graph (, )][DBLP]


  12. Scheduling with Outliers. [Citation Graph (, )][DBLP]


  13. Improved Inapproximability Results for Maximum k-Colorable Subgraph. [Citation Graph (, )][DBLP]


  14. Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems. [Citation Graph (, )][DBLP]


  15. On the Optimality of Gluing over Scales. [Citation Graph (, )][DBLP]


  16. On Hardness of Pricing Items for Single-Minded Bidders. [Citation Graph (, )][DBLP]


  17. Real-Time Message Routing and Scheduling. [Citation Graph (, )][DBLP]


  18. Approximating Some Network Design Problems with Node Costs. [Citation Graph (, )][DBLP]


  19. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. [Citation Graph (, )][DBLP]


  20. Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy. [Citation Graph (, )][DBLP]


  21. Minimizing Average Shortest Path Distances via Shortcut Edge Addition. [Citation Graph (, )][DBLP]


  22. Approximating Node-Connectivity Augmentation Problems. [Citation Graph (, )][DBLP]


  23. A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. [Citation Graph (, )][DBLP]


  24. Approximation Algorithms for Domatic Partitions of Unit Disk Graphs. [Citation Graph (, )][DBLP]


  25. On the Complexity of the Asymmetric VPN Problem. [Citation Graph (, )][DBLP]


  26. Deterministic Approximation Algorithms for the Nearest Codeword Problem. [Citation Graph (, )][DBLP]


  27. Strong Parallel Repetition Theorem for Free Projection Games. [Citation Graph (, )][DBLP]


  28. Random Low Degree Polynomials are Hard to Approximate. [Citation Graph (, )][DBLP]


  29. Composition of Semi-LTCs by Two-Wise Tensor Products. [Citation Graph (, )][DBLP]


  30. On the Security of Goldreich's One-Way Function. [Citation Graph (, )][DBLP]


  31. Random Tensors and Planted Cliques. [Citation Graph (, )][DBLP]


  32. Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry. [Citation Graph (, )][DBLP]


  33. Average-Case Analyses of Vickrey Costs. [Citation Graph (, )][DBLP]


  34. A Hypergraph Dictatorship Test with Perfect Completeness. [Citation Graph (, )][DBLP]


  35. Extractors Using Hardness Amplification. [Citation Graph (, )][DBLP]


  36. How Well Do Random Walks Parallelize?. [Citation Graph (, )][DBLP]


  37. An Analysis of Random-Walk Cuckoo Hashing. [Citation Graph (, )][DBLP]


  38. Hierarchy Theorems for Property Testing. [Citation Graph (, )][DBLP]


  39. Algorithmic Aspects of Property Testing in the Dense Graphs Model. [Citation Graph (, )][DBLP]


  40. Succinct Representation of Codes with Applications to Testing. [Citation Graph (, )][DBLP]


  41. Efficient Quantum Tensor Product Expanders and k-Designs. [Citation Graph (, )][DBLP]


  42. Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND. [Citation Graph (, )][DBLP]


  43. Pseudorandom Generators and Typically-Correct Derandomization. [Citation Graph (, )][DBLP]


  44. Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions. [Citation Graph (, )][DBLP]


  45. Tolerant Linearity Testing and Locally Testable Codes. [Citation Graph (, )][DBLP]


  46. Pseudorandom Bit Generators That Fool Modular Sums. [Citation Graph (, )][DBLP]


  47. The Glauber Dynamics for Colourings of Bounded Degree Trees. [Citation Graph (, )][DBLP]


  48. Testing ±1-weight halfspace. [Citation Graph (, )][DBLP]


  49. Small-Bias Spaces for Group Products. [Citation Graph (, )][DBLP]


  50. Small Clique Detection and Approximate Nash Equilibria. [Citation Graph (, )][DBLP]


  51. Testing Computability by Width Two OBDDs. [Citation Graph (, )][DBLP]


  52. Improved Polynomial Identity Testing for Read-Once Formulas. [Citation Graph (, )][DBLP]


  53. Smooth Analysis of the Condition Number and the Least Singular Value. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002