LIPIcs, Volume 40, APPROX/RANDOM 2015

• Naveen Garg, Klaus Jansen, Anup Rao, and José D. P. Rolim LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume 10.4230/LIPIcs.APPROX-RANDOM.2015
• Naveen Garg, Klaus Jansen, Anup Rao, and José D. P. Rolim Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors 10.4230/LIPIcs.APPROX-RANDOM.2015.i
• Fidaa Abed, Parinya Chalermsook, José Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, and Andreas Wiese On Guillotine Cutting Sequences 10.4230/LIPIcs.APPROX-RANDOM.2015.1
• Ittai Abraham, Shiri Chechik, Robert Krauthgamer, and Udi Wieder Approximate Nearest Neighbor Search in Metrics of Planar Graphs 10.4230/LIPIcs.APPROX-RANDOM.2015.20
• Anna Adamaszek, Parinya Chalermsook, and Andreas Wiese How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking 10.4230/LIPIcs.APPROX-RANDOM.2015.43
• David Adjiashvili Non-Uniform Robust Network Design in Planar Graphs 10.4230/LIPIcs.APPROX-RANDOM.2015.61
• Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, and Hehui Wu Large Supports are Required for Well-Supported Nash Equilibria 10.4230/LIPIcs.APPROX-RANDOM.2015.78
• Nikhil Bansal and Bouke Cloostermans Minimizing Maximum Flow-time on Related Machines 10.4230/LIPIcs.APPROX-RANDOM.2015.85
• Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, and Cliff Stein A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs 10.4230/LIPIcs.APPROX-RANDOM.2015.96
• Boaz Barak, Ankur Moitra, Ryan O’Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, and John Wright Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree 10.4230/LIPIcs.APPROX-RANDOM.2015.110
• Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, and Pan Xu Improved Bounds in Stochastic Matching and Optimization 10.4230/LIPIcs.APPROX-RANDOM.2015.124
• Sebastian Berndt, Klaus Jansen, and Kim-Manuel Klein Fully Dynamic Bin Packing Revisited 10.4230/LIPIcs.APPROX-RANDOM.2015.135
• Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, and Euiwoong Lee Approximate Hypergraph Coloring under Low-discrepancy and Related Promises 10.4230/LIPIcs.APPROX-RANDOM.2015.152
• Lin Chen, Nicole Megow, Roman Rischke, and Leen Stougie Stochastic and Robust Scheduling in the Cloud 10.4230/LIPIcs.APPROX-RANDOM.2015.175
• Julia Chuzhoy and David H. K. Kim On Approximating Node-Disjoint Paths in Grids 10.4230/LIPIcs.APPROX-RANDOM.2015.187
• Marek Cygan and Tomasz Kociumaka Approximating Upper Degree-Constrained Partial Orientations 10.4230/LIPIcs.APPROX-RANDOM.2015.212
• Zachary Drudi, Nicholas J. A. Harvey, Stephen Ingram, Andrew Warfield, and Jake Wires Approximating Hit Rate Curves using Streaming Algorithms 10.4230/LIPIcs.APPROX-RANDOM.2015.225
• Michael Elkin, Arnold Filtser, and Ofer Neiman Terminal Embeddings 10.4230/LIPIcs.APPROX-RANDOM.2015.242
• Zachary Friggstad and Zhihan Gao On Linear Programming Relaxations for Unsplittable Flow in Trees 10.4230/LIPIcs.APPROX-RANDOM.2015.265
• Venkatesan Guruswami and Euiwoong Lee Inapproximability of H-Transversal/Packing 10.4230/LIPIcs.APPROX-RANDOM.2015.284
• Venkatesan Guruswami and Euiwoong Lee Towards a Characterization of Approximation Resistance for Symmetric CSPs 10.4230/LIPIcs.APPROX-RANDOM.2015.305
• David G. Harris and Francis Sullivan Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs 10.4230/LIPIcs.APPROX-RANDOM.2015.323
• Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O’Donnell, and John Wright Improved NP-Inapproximability for 2-Variable Linear Equations 10.4230/LIPIcs.APPROX-RANDOM.2015.341
• Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, and Hiroki Yanagisawa A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties 10.4230/LIPIcs.APPROX-RANDOM.2015.361
• Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, and Ravi Sundaram Designing Overlapping Networks for Publish-Subscribe Systems 10.4230/LIPIcs.APPROX-RANDOM.2015.381
• Pasin Manurangsi and Dana Moshkovitz Approximating Dense Max 2-CSPs 10.4230/LIPIcs.APPROX-RANDOM.2015.396
• Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, and Joel L. Wolf The Container Selection Problem 10.4230/LIPIcs.APPROX-RANDOM.2015.416
• Xiaoming Sun and David P. Woodruff Tight Bounds for Graph Problems in Insertion Streams 10.4230/LIPIcs.APPROX-RANDOM.2015.435
• Jayadev Acharya, Clément L. Canonne, and Gautam Kamath A Chasm Between Identity and Equivalence Testing with Conditional Queries 10.4230/LIPIcs.APPROX-RANDOM.2015.449
• Victor Bapst and Amin Coja-Oghlan Harnessing the Bethe Free Energy 10.4230/LIPIcs.APPROX-RANDOM.2015.467
• Balthazar Bauer, Shay Moran, and Amir Yehudayoff Internal Compression of Protocols to Entropy 10.4230/LIPIcs.APPROX-RANDOM.2015.481
• Amey Bhangale, Ramprasad Saptharishi, Girish Varma, and Rakesh Venkat On Fortification of Projection Games 10.4230/LIPIcs.APPROX-RANDOM.2015.497
• Eric Blais, Clément L. Canonne, Igor C. Oliveira, Rocco A. Servedio, and Li-Yang Tan Learning Circuits with few Negations 10.4230/LIPIcs.APPROX-RANDOM.2015.512
• Antonio Blanca and Alistair Sinclair Dynamics for the Mean-field Random-cluster Model 10.4230/LIPIcs.APPROX-RANDOM.2015.528
• Ralph Christian Bottesch, Dmitry Gavinsky, and Hartmut Klauck Correlation in Hard Distributions in Communication Complexity 10.4230/LIPIcs.APPROX-RANDOM.2015.544
• Vladimir Braverman, Rafail Ostrovsky, and Alan Roytman Zero-One Laws for Sliding Windows and Universal Sketches 10.4230/LIPIcs.APPROX-RANDOM.2015.573
• Vladimir Braverman and Stephen R. Chestnut Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums 10.4230/LIPIcs.APPROX-RANDOM.2015.591
• Joshua Brody and Mario Sanchez Dependent Random Graphs and Multi-Party Pointer Jumping 10.4230/LIPIcs.APPROX-RANDOM.2015.606
• Mark Bun and Thomas Steinke Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness 10.4230/LIPIcs.APPROX-RANDOM.2015.625
• Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova Tighter Connections between Derandomization and Circuit Lower Bounds 10.4230/LIPIcs.APPROX-RANDOM.2015.645
• Shiri Chechik, Edith Cohen, and Haim Kaplan Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees 10.4230/LIPIcs.APPROX-RANDOM.2015.659
• Gil Cohen and Avishay Tal Two Structural Results for Low Degree Polynomials and Applications 10.4230/LIPIcs.APPROX-RANDOM.2015.680
• Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch The Minimum Bisection in the Planted Bisection Model 10.4230/LIPIcs.APPROX-RANDOM.2015.710
• Amin Coja-Oghlan, Charilaos Efthymiou, and Nor Jaafari Local Convergence of Random Graph Colorings 10.4230/LIPIcs.APPROX-RANDOM.2015.726
• Michael Dinitz, Robert Krauthgamer, and Tal Wagner Towards Resistance Sparsifiers 10.4230/LIPIcs.APPROX-RANDOM.2015.738
• Charilaos Efthymiou Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees 10.4230/LIPIcs.APPROX-RANDOM.2015.756
• David Felber and Rafail Ostrovsky A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words 10.4230/LIPIcs.APPROX-RANDOM.2015.775
• Hendrik Fichtenberger, Pan Peng, and Christian Sohler On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs 10.4230/LIPIcs.APPROX-RANDOM.2015.786
• Michael A. Forbes and Venkatesan Guruswami Dimension Expanders via Rank Condensers 10.4230/LIPIcs.APPROX-RANDOM.2015.800
• Andreas Galanis, Daniel Štefankovic, and Eric Vigoda Swendsen-Wang Algorithm on the Mean-Field Potts Model 10.4230/LIPIcs.APPROX-RANDOM.2015.815
• Rong Ge and Tengyu Ma Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms 10.4230/LIPIcs.APPROX-RANDOM.2015.829
• Siyao Guo and Ilan Komargodski Negation-Limited Formulas 10.4230/LIPIcs.APPROX-RANDOM.2015.850
• Venkatesan Guruswami and Carol Wang Deletion Codes in the High-noise and High-rate Regimes 10.4230/LIPIcs.APPROX-RANDOM.2015.867
• Bernhard Haeupler, Pritish Kamath, and Ameya Velingker Communication with Partial Noiseless Feedback 10.4230/LIPIcs.APPROX-RANDOM.2015.881
• Shiva Prasad Kasiviswanathan and Mark Rudelson Spectral Norm of Random Kernel Matrices with Applications to Privacy 10.4230/LIPIcs.APPROX-RANDOM.2015.898
• Robin Kothari, David Racicot-Desloges, and Miklos Santha Separating Decision Tree Complexity from Subcube Partition Complexity 10.4230/LIPIcs.APPROX-RANDOM.2015.915
• Elchanan Mossel and Sebastien Roch Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the Coalescent 10.4230/LIPIcs.APPROX-RANDOM.2015.931
• Ilya Volkovich Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials 10.4230/LIPIcs.APPROX-RANDOM.2015.943