- Chandan K. Dubey, Thomas Holenstein:
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle. APPROX-RANDOM 2011: 184-193 - Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. APPROX-RANDOM 2011: 194-205 - Alan Edelman, Avinatan Hassidim, Huy N. Nguyen, Krzysztof Onak:
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs. APPROX-RANDOM 2011: 530-541 - Sándor P. Fekete, Tom Kamphans, Alexander Kröller, Joseph S. B. Mitchell, Christiane Schmidt:
Exploring and Triangulating a Region by a Swarm of Robots. APPROX-RANDOM 2011: 206-217 - Moran Feldman, Joseph Naor, Roy Schwartz:
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM 2011: 218-229 - Eldar Fischer, Eyal Rozenberg:
Inflatable Graph Properties and Natural Property Tests. APPROX-RANDOM 2011: 542-554 - Tobias Friedrich, Lionel Levine:
Fast Simulation of Large-Scale Growth Models. APPROX-RANDOM 2011: 555-566 - Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. APPROX-RANDOM 2011: 567-578 - Oded Goldreich, Tali Kaufman:
Proximity Oblivious Testing and the Role of Invariances. APPROX-RANDOM 2011: 579-592 - Inge Li Gørtz, Viswanath Nagarajan:
Locating Depots for Capacitated Vehicle Routing. APPROX-RANDOM 2011: 230-241 - Venkatesan Guruswami, Carol Wang:
Optimal Rate List Decoding via Derivative Codes. APPROX-RANDOM 2011: 593-604 - Johan Håstad:
Satisfying Degree-d Equations over GF[2] n. APPROX-RANDOM 2011: 242-253 - Brett Hemenway, Rafail Ostrovsky, Martin J. Strauss, Mary Wootters:
Public Key Locally Decodable Codes with Short Keys. APPROX-RANDOM 2011: 605-615 - Zhiyi Huang, Sampath Kannan:
On Sampling from Multivariate Distributions. APPROX-RANDOM 2011: 616-627 - Zhiyi Huang, Lei Wang, Yuan Zhou:
Black-Box Reductions in Mechanism Design. APPROX-RANDOM 2011: 254-265 - Daniel Kane, Raghu Meka, Jelani Nelson:
Almost Optimal Explicit Johnson-Lindenstrauss Families. APPROX-RANDOM 2011: 628-639 - Michael Kapralov, Rina Panigrahy:
Multiplicative Approximations of Random Walk Transition Probabilities. APPROX-RANDOM 2011: 266-276 - Marek Karpinski, Warren Schudy:
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems. APPROX-RANDOM 2011: 277-288 - Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Network-Design with Degree Constraints. APPROX-RANDOM 2011: 289-301 - M. Reza Khani, Mohammad R. Salavatipour:
Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems. APPROX-RANDOM 2011: 302-314 - Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala:
Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions. APPROX-RANDOM 2011: 315-326 - Shachar Lovett, Srikanth Srinivasan:
Correlation Bounds for Poly-size $\mbox{\rm AC}0$ Circuits with n 1 - o(1) Symmetric Gates. APPROX-RANDOM 2011: 640-651 - Sarah Miracle, Dana Randall, Amanda Pascoe Streib:
Clustering in Interfering Binary Mixtures. APPROX-RANDOM 2011: 652-663 - Dana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein:
Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity. APPROX-RANDOM 2011: 664-675 - Dana Ron, Gilad Tsur:
On Approximating the Number of Relevant Variables in a Function. APPROX-RANDOM 2011: 676-687 - Sushant Sachdeva, Rishi Saket:
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs. APPROX-RANDOM 2011: 327-338 - Sagi Snir, Raphael Yuster:
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs. APPROX-RANDOM 2011: 339-350 - Thomas Watson:
Query Complexity in Errorless Hardness Amplification. APPROX-RANDOM 2011: 688-699 - Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings. Lecture Notes in Computer Science 6845, Springer 2011, ISBN 978-3-642-22934-3 [contents]