The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Ashkan Aazami, Michael D. Stilp
    Approximation Algorithms and Hardness for Domination with Propagation. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:1-15 [Conf]
  2. Moshe Babaioff, Nicole Immorlica, David Kempe, Robert Kleinberg
    A Knapsack Secretary Problem with Applications. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:16-28 [Conf]
  3. Jaroslaw Byrka
    An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:29-43 [Conf]
  4. Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh
    Improved Approximation Algorithms for the Spanning Star Forest Problem. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:44-58 [Conf]
  5. Victor Chepoi, Bertrand Estellon
    Packing and Covering delta -Hyperbolic Spaces by Balls. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:59-73 [Conf]
  6. Ilias Diakonikolas, Mihalis Yannakakis
    Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:74-88 [Conf]
  7. Shahar Dobzinski
    Two Randomized Mechanisms for Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:89-103 [Conf]
  8. Uriel Feige, Mohit Singh
    Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:104-118 [Conf]
  9. Greg N. Frederickson, Barry Wittman
    Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:119-133 [Conf]
  10. Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar
    Stochastic Steiner Tree with Non-uniform Inflation. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:134-148 [Conf]
  11. Johan Håstad
    On the Approximation Resistance of a Random Predicate. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:149-163 [Conf]
  12. Hamed Hatami, Avner Magen, Evangelos Markakis
    Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:164-179 [Conf]
  13. Kazuo Iwama, Guochuan Zhang
    Optimal Resource Augmentations for Online Knapsack. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:180-188 [Conf]
  14. Chadi Kari, Yoo Ah Kim, Seungjoon Lee, Alexander Russell, Minho Shin
    Soft Edge Coloring. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:189-203 [Conf]
  15. Subhash Khot, Ashok Kumar Ponnuswami
    Approximation Algorithms for the Max-Min Allocation Problem. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:204-217 [Conf]
  16. Subhash Khot, Rishi Saket
    Hardness of Embedding Metric Spaces of Equal Size. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:218-227 [Conf]
  17. James R. Lee, Prasad Raghavendra
    Coarse Differentiation and Multi-flows in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:228-241 [Conf]
  18. Manor Mendel, Assaf Naor
    Maximum Gradient Embeddings and Monotone Clustering. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:242-256 [Conf]
  19. Viswanath Nagarajan, R. Ravi
    Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:257-270 [Conf]
  20. Andreas S. Schulz, Nelson A. Uhan
    Encouraging Cooperation in Sharing Supermodular Costs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:271-285 [Conf]
  21. Raphael Yuster
    Almost Exact Matchings. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:286-295 [Conf]
  22. Kfir Barhum, Oded Goldreich, Adi Shraibman
    On Approximating the Average Distance Between Points. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:296-310 [Conf]
  23. Omer Barkol, Yuval Ishai, Enav Weinreb
    On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:311-325 [Conf]
  24. Mohsen Bayati, Jeong Han Kim, Amin Saberi
    A Sequential Algorithm for Generating Random Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:326-340 [Conf]
  25. Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
    Local Limit Theorems for the Giant Component of Random Hypergraphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:341-352 [Conf]
  26. Ilia Binder, Mark Braverman
    Derandomization of Euclidean Random Walks. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:353-365 [Conf]
  27. Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin
    High Entropy Random Selection Protocols. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:366-379 [Conf]
  28. Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman
    Testing st -Connectivity. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:380-394 [Conf]
  29. Arkadev Chattopadhyay, Bruce A. Reed
    Properly 2-Colouring Linear Hypergraphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:395-408 [Conf]
  30. Jacek Cichon, Marek Klonowski, Lukasz Krzywiecki, Bartlomiej Rózanski, Pawel Zielinski
    Random Subsets of the Interval and P2P Protocols. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:409-421 [Conf]
  31. Colin Cooper, Alan Frieze
    The Cover Time of Random Digraphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:422-435 [Conf]
  32. Yael Dekel, James R. Lee, Nathan Linial
    Eigenvectors of Random Graphs: Nodal Domains. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:436-448 [Conf]
  33. Scott Diehl
    Lower Bounds for Swapping Arthur and Merlin. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:449-463 [Conf]
  34. Eldar Fischer, Eyal Rozenberg
    Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:464-478 [Conf]
  35. Sumit Ganguly, Graham Cormode
    On Estimating Frequency Moments of Data Streams. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:479-493 [Conf]
  36. Dana Glasner, Rocco A. Servedio
    Distribution-Free Testing Lower Bounds for Basic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:494-508 [Conf]
  37. Oded Goldreich, Or Sheffet
    On the Randomness Complexity of Property Testing. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:509-524 [Conf]
  38. Mira Gonen, Dana Ron
    On the Benefits of Adaptivity in Property Testing of Dense Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:525-539 [Conf]
  39. Sam Greenberg, Dana Randall
    Slow Mixing of Markov Chains Using Fault Lines and Fat Contours. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:540-553 [Conf]
  40. Venkatesan Guruswami, Atri Rudra
    Better Binary List-Decodable Codes Via Multilevel Concatenation. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:554-568 [Conf]
  41. Dan Gutfreund, Amnon Ta-Shma
    Worst-Case to Average-Case Reductions Revisited. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:569-583 [Conf]
  42. Ravi Kumar, Rina Panigrahy
    On Finding Frequent Elements in a Data Stream. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:584-595 [Conf]
  43. Moni Naor, Asaf Nussboim
    Implementing Huge Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:596-608 [Conf]
  44. Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith
    Sublinear Algorithms for Approximating String Compressibility. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:609-623 [Conf]
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