default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th RANDOM / 10th APPROX 2007: Princeton, NJ, USA
- Moses Charikar
, Klaus Jansen, Omer Reingold, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings. Lecture Notes in Computer Science 4627, Springer 2007, ISBN 978-3-540-74207-4
Contributed Talks of APPROX
- Ashkan Aazami, Michael D. Stilp:
Approximation Algorithms and Hardness for Domination with Propagation. 1-15 - Moshe Babaioff, Nicole Immorlica, David Kempe, Robert Kleinberg:
A Knapsack Secretary Problem with Applications. 16-28 - Jaroslaw Byrka:
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. 29-43 - Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh:
Improved Approximation Algorithms for the Spanning Star Forest Problem. 44-58 - Victor Chepoi, Bertrand Estellon:
Packing and Covering delta -Hyperbolic Spaces by Balls. 59-73 - Ilias Diakonikolas, Mihalis Yannakakis:
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems. 74-88 - Shahar Dobzinski:
Two Randomized Mechanisms for Combinatorial Auctions. 89-103 - Uriel Feige, Mohit Singh:
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs. 104-118 - Greg N. Frederickson, Barry Wittman:
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows. 119-133 - Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar:
Stochastic Steiner Tree with Non-uniform Inflation. 134-148 - Johan Håstad:
On the Approximation Resistance of a Random Predicate. 149-163 - Hamed Hatami, Avner Magen, Evangelos Markakis:
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics. 164-179 - Kazuo Iwama, Guochuan Zhang:
Optimal Resource Augmentations for Online Knapsack. 180-188 - Chadi Kari, Yoo Ah Kim, Seungjoon Lee, Alexander Russell, Minho Shin:
Soft Edge Coloring. 189-203 - Subhash Khot, Ashok Kumar Ponnuswami:
Approximation Algorithms for the Max-Min Allocation Problem. 204-217 - Subhash Khot, Rishi Saket:
Hardness of Embedding Metric Spaces of Equal Size. 218-227 - James R. Lee, Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs. 228-241 - Manor Mendel, Assaf Naor:
Maximum Gradient Embeddings and Monotone Clustering. 242-256 - Viswanath Nagarajan, R. Ravi:
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. 257-270 - Andreas S. Schulz, Nelson A. Uhan:
Encouraging Cooperation in Sharing Supermodular Costs. 271-285 - Raphael Yuster:
Almost Exact Matchings. 286-295
Contributed Talks of RANDOM
- Kfir Barhum, Oded Goldreich, Adi Shraibman:
On Approximating the Average Distance Between Points. 296-310 - Omer Barkol, Yuval Ishai, Enav Weinreb:
On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR. 311-325 - Mohsen Bayati, Jeong Han Kim, Amin Saberi:
A Sequential Algorithm for Generating Random Graphs. 326-340 - Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
Local Limit Theorems for the Giant Component of Random Hypergraphs. 341-352 - Ilia Binder, Mark Braverman:
Derandomization of Euclidean Random Walks. 353-365 - Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin:
High Entropy Random Selection Protocols. 366-379 - Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman:
Testing st -Connectivity. 380-394 - Arkadev Chattopadhyay, Bruce A. Reed:
Properly 2-Colouring Linear Hypergraphs. 395-408 - Jacek Cichon, Marek Klonowski, Lukasz Krzywiecki, Bartlomiej Rózanski, Pawel Zielinski:
Random Subsets of the Interval and P2P Protocols. 409-421 - Colin Cooper, Alan M. Frieze:
The Cover Time of Random Digraphs. 422-435 - Yael Dekel, James R. Lee, Nathan Linial:
Eigenvectors of Random Graphs: Nodal Domains. 436-448 - Scott Diehl:
Lower Bounds for Swapping Arthur and Merlin. 449-463 - Eldar Fischer, Eyal Rozenberg:
Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects. 464-478 - Sumit Ganguly, Graham Cormode:
On Estimating Frequency Moments of Data Streams. 479-493 - Dana Glasner, Rocco A. Servedio:
Distribution-Free Testing Lower Bounds for Basic Boolean Functions. 494-508 - Oded Goldreich, Or Sheffet:
On the Randomness Complexity of Property Testing. 509-524 - Mira Gonen, Dana Ron:
On the Benefits of Adaptivity in Property Testing of Dense Graphs. 525-539 - Sam Greenberg, Dana Randall:
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours. 540-553 - Venkatesan Guruswami, Atri Rudra:
Better Binary List-Decodable Codes Via Multilevel Concatenation. 554-568 - Dan Gutfreund, Amnon Ta-Shma:
Worst-Case to Average-Case Reductions Revisited. 569-583 - Ravi Kumar, Rina Panigrahy:
On Finding Frequent Elements in a Data Stream. 584-595 - Moni Naor, Asaf Nussboim:
Implementing Huge Sparse Random Graphs. 596-608 - Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith:
Sublinear Algorithms for Approximating String Compressibility. 609-623
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
