|
|
Conferences in DBLP
- 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]
- 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]
- 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]
- 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]
- Victor Chepoi, Bertrand Estellon
Packing and Covering delta -Hyperbolic Spaces by Balls. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:59-73 [Conf]
- 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]
- Shahar Dobzinski
Two Randomized Mechanisms for Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:89-103 [Conf]
- 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]
- 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]
- 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]
- Johan Håstad
On the Approximation Resistance of a Random Predicate. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:149-163 [Conf]
- 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]
- Kazuo Iwama, Guochuan Zhang
Optimal Resource Augmentations for Online Knapsack. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:180-188 [Conf]
- 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]
- 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]
- Subhash Khot, Rishi Saket
Hardness of Embedding Metric Spaces of Equal Size. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:218-227 [Conf]
- 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]
- Manor Mendel, Assaf Naor
Maximum Gradient Embeddings and Monotone Clustering. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:242-256 [Conf]
- 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]
- Andreas S. Schulz, Nelson A. Uhan
Encouraging Cooperation in Sharing Supermodular Costs. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:271-285 [Conf]
- Raphael Yuster
Almost Exact Matchings. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:286-295 [Conf]
- 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]
- 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]
- 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]
- 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]
- Ilia Binder, Mark Braverman
Derandomization of Euclidean Random Walks. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:353-365 [Conf]
- 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]
- 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]
- Arkadev Chattopadhyay, Bruce A. Reed
Properly 2-Colouring Linear Hypergraphs. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:395-408 [Conf]
- 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]
- Colin Cooper, Alan Frieze
The Cover Time of Random Digraphs. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:422-435 [Conf]
- 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]
- Scott Diehl
Lower Bounds for Swapping Arthur and Merlin. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:449-463 [Conf]
- 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]
- Sumit Ganguly, Graham Cormode
On Estimating Frequency Moments of Data Streams. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:479-493 [Conf]
- 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]
- Oded Goldreich, Or Sheffet
On the Randomness Complexity of Property Testing. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:509-524 [Conf]
- 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]
- 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]
- Venkatesan Guruswami, Atri Rudra
Better Binary List-Decodable Codes Via Multilevel Concatenation. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:554-568 [Conf]
- Dan Gutfreund, Amnon Ta-Shma
Worst-Case to Average-Case Reductions Revisited. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:569-583 [Conf]
- Ravi Kumar, Rina Panigrahy
On Finding Frequent Elements in a Data Stream. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:584-595 [Conf]
- Moni Naor, Asaf Nussboim
Implementing Huge Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
APPROX-RANDOM, 2007, pp:596-608 [Conf]
- 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]
|
