The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Approximating Optimal Binary Decision Trees. [Citation Graph (, )][DBLP]

  2. Santa Claus Meets Hypergraph Matchings. [Citation Graph (, )][DBLP]

  3. Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. [Citation Graph (, )][DBLP]

  4. Connected Vertex Covers in Dense Graphs. [Citation Graph (, )][DBLP]

  5. Improved Approximation Guarantees through Higher Levels of SDP Hierarchies. [Citation Graph (, )][DBLP]

  6. Sweeping Points. [Citation Graph (, )][DBLP]

  7. Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness. [Citation Graph (, )][DBLP]

  8. Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks. [Citation Graph (, )][DBLP]

  9. Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP. [Citation Graph (, )][DBLP]

  10. Approximating Maximum Subgraphs without Short Cycles. [Citation Graph (, )][DBLP]

  11. Deterministic 7/8-Approximation for the Metric Maximum TSP. [Citation Graph (, )][DBLP]

  12. Inapproximability of Survivable Networks. [Citation Graph (, )][DBLP]

  13. Approximating Single Machine Scheduling with Scenarios. [Citation Graph (, )][DBLP]

  14. Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity. [Citation Graph (, )][DBLP]

  15. A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One. [Citation Graph (, )][DBLP]

  16. The Directed Minimum Latency Problem. [Citation Graph (, )][DBLP]

  17. A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem. [Citation Graph (, )][DBLP]

  18. Approximating Directed Weighted-Degree Constrained Networks. [Citation Graph (, )][DBLP]

  19. A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs. [Citation Graph (, )][DBLP]

  20. Budgeted Allocations in the Full-Information Setting. [Citation Graph (, )][DBLP]

  21. Optimal Random Matchings on Trees and Applications. [Citation Graph (, )][DBLP]

  22. Small Sample Spaces Cannot Fool Low Degree Polynomials. [Citation Graph (, )][DBLP]

  23. Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. [Citation Graph (, )][DBLP]

  24. Tensor Products of Weakly Smooth Codes Are Robust. [Citation Graph (, )][DBLP]

  25. On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs. [Citation Graph (, )][DBLP]

  26. Improved Bounds for Testing Juntas. [Citation Graph (, )][DBLP]

  27. The Complexity of Distinguishing Markov Random Fields. [Citation Graph (, )][DBLP]

  28. Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. [Citation Graph (, )][DBLP]

  29. Tight Bounds for Hashing Block Sources. [Citation Graph (, )][DBLP]

  30. Improved Separations between Nondeterministic and Randomized Multiparty Communication. [Citation Graph (, )][DBLP]

  31. Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs. [Citation Graph (, )][DBLP]

  32. On the Query Complexity of Testing Orientations for Being Eulerian. [Citation Graph (, )][DBLP]

  33. Approximately Counting Embeddings into Random Graphs. [Citation Graph (, )][DBLP]

  34. Increasing the Output Length of Zero-Error Dispersers. [Citation Graph (, )][DBLP]

  35. Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals. [Citation Graph (, )][DBLP]

  36. The Complexity of Local List Decoding. [Citation Graph (, )][DBLP]

  37. Limitations of Hardness vs. Randomness under Uniform Reductions. [Citation Graph (, )][DBLP]

  38. Learning Random Monotone DNF. [Citation Graph (, )][DBLP]

  39. Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2). [Citation Graph (, )][DBLP]

  40. Dense Fast Random Projections and Lean Walsh Transforms. [Citation Graph (, )][DBLP]

  41. Near Optimal Dimensionality Reductions That Preserve Volumes. [Citation Graph (, )][DBLP]

  42. Sampling Hypersurfaces through Diffusion. [Citation Graph (, )][DBLP]

  43. A 2-Source Almost-Extractor for Linear Entropy. [Citation Graph (, )][DBLP]

  44. Extractors for Three Uneven-Length Sources. [Citation Graph (, )][DBLP]

  45. The Power of Choice in a Generalized Pólya Urn Model. [Citation Graph (, )][DBLP]

  46. Corruption and Recovery-Efficient Locally Decodable Codes. [Citation Graph (, )][DBLP]

  47. Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002