share record
persistent URL:
Alexander Golovnev , Oded Regev , Omri Weinstein : The Minrank of Random Graphs. APPROX-RANDOM 2017 : 46:1-46:13 share record
persistent URL:
Anupam Gupta , Archit Karandikar : Stochastic Unsplittable Flows. APPROX-RANDOM 2017 : 7:1-7:19 share record
persistent URL:
Venkatesan Guruswami , Ray Li : Efficiently Decodable Codes for the Binary Deletion Channel. APPROX-RANDOM 2017 : 47:1-47:13 export record
dblp key:
conf/approx/GuruswamiVV17 share record
persistent URL:
Venkatesan Guruswami , Ameya Velingker , Santhoshini Velusamy : Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph. APPROX-RANDOM 2017 : 8:1-8:19 share record
persistent URL:
Samuel Haney , Bruce M. Maggs , Biswaroop Maiti , Debmalya Panigrahi , Rajmohan Rajaraman , Ravi Sundaram : Symmetric Interdiction for Matching Problems. APPROX-RANDOM 2017 : 9:1-9:19 share record
persistent URL:
David G. Harris , Thomas W. Pensyl , Aravind Srinivasan , Khoa Trinh : A Lottery Model for Center-Type Problems with Outliers. APPROX-RANDOM 2017 : 10:1-10:19 share record
persistent URL:
Chien-Chung Huang , Naonori Kakimura , Yuichi Yoshida : Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. APPROX-RANDOM 2017 : 11:1-11:14 share record
persistent URL:
Piotr Indyk , Sepideh Mahabadi , Ronitt Rubinfeld , Jonathan R. Ullman , Ali Vakilian , Anak Yodpinyanee : Fractional Set Cover in the Streaming Model. APPROX-RANDOM 2017 : 12:1-12:20 share record
persistent URL:
Klaus Jansen , Kim-Manuel Klein , Maria Kosche , Leon Ladewig : Online Strip Packing with Polynomial Migration. APPROX-RANDOM 2017 : 13:1-13:18 share record
persistent URL:
Gorav Jindal , Pavel Kolev , Richard Peng , Saurabh Sawlani : Density Independent Algorithms for Sparsifying k-Step Random Walks. APPROX-RANDOM 2017 : 14:1-14:17 share record
persistent URL:
Sagar Kale , Sumedh Tirodkar : Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams. APPROX-RANDOM 2017 : 15:1-15:21 export record
dblp key:
conf/approx/KesselheimT17 share record
persistent URL:
Thomas Kesselheim , Andreas Tönnis : Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. APPROX-RANDOM 2017 : 16:1-16:22 export record
dblp key:
conf/approx/KonemannOP0SV17 share record
persistent URL:
Jochen Könemann , Neil Olver , Kanstantsin Pashkovich , R. Ravi , Chaitanya Swamy , Jens Vygen : On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM 2017 : 17:1-17:13 share record
persistent URL:
Edo Liberty , Maxim Sviridenko : Greedy Minimization of Weakly Supermodular Set Functions. APPROX-RANDOM 2017 : 19:1-19:11 share record
persistent URL:
Maciej Obremski , Maciej Skorski : Renyi Entropy Estimation Revisited. APPROX-RANDOM 2017 : 20:1-20:15 share record
persistent URL:
Yuval Rabani , Rakesh Venkat : Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces. APPROX-RANDOM 2017 : 21:1-21:14 export record
dblp key:
conf/approx/RoughgardenTV17 share record
persistent URL:
Tim Roughgarden , Inbal Talgam-Cohen , Jan Vondrák : When Are Welfare Guarantees Robust?. APPROX-RANDOM 2017 : 22:1-22:23 share record
persistent URL:
Ilya Volkovich : On Some Computations on Sparse Polynomials. APPROX-RANDOM 2017 : 48:1-48:21 share record
persistent URL:
Thomas Watson : Communication Complexity of Statistical Distance. APPROX-RANDOM 2017 : 49:1-49:10 share record
persistent URL:
Frontmatter, Table of Contents, Preface, Organization, External Reviewers, List of Authors. APPROX-RANDOM 2017 : 0:1-0:1 share record
persistent URL:
Klaus Jansen , José D. P. Rolim , David Williamson , Santosh S. Vempala : Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA. LIPIcs 81, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017 , ISBN 978-3-95977-044-6 [contents]