LIPIcs, Volume 28, APPROX/RANDOM 2014

• Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, and Cristopher Moore LIPIcs, Volume 28, APPROX/RANDOM'14, Complete Volume 10.4230/LIPIcs.APPROX-RANDOM.2014
• Klaus Jansen, José Rolim, Nikhil R. Devanur, and Cristopher Moore Frontmatter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.APPROX-RANDOM.2014.i
• Ittai Abraham, Shiri Chechik, and Kunal Talwar Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier 10.4230/LIPIcs.APPROX-RANDOM.2014.1
• Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, and Chaitanya Swamy Approximation Algorithms for Minimum-Load k-Facility Location 10.4230/LIPIcs.APPROX-RANDOM.2014.17
• Noga Alon, Troy Lee, and Adi Shraibman The Cover Number of a Matrix and its Algorithmic Applications 10.4230/LIPIcs.APPROX-RANDOM.2014.34
• Siddharth Barman, Shuchi Chawla, and Seeun Umboh Network Design with Coverage Costs 10.4230/LIPIcs.APPROX-RANDOM.2014.48
• Kshipra Bhawalkar, Sreenivas Gollapudi, and Debmalya Panigrahi Online Set Cover with Set Requests 10.4230/LIPIcs.APPROX-RANDOM.2014.64
• Eden Chlamtác and Michael Dinitz Lowest Degree k-Spanner: Approximation and Hardness 10.4230/LIPIcs.APPROX-RANDOM.2014.80
• Michael Crouch and Daniel M. Stubbs Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching 10.4230/LIPIcs.APPROX-RANDOM.2014.96
• Amit Deshpande and Rakesh Venkat Guruswami-Sinop Rounding without Higher Level Lasserre 10.4230/LIPIcs.APPROX-RANDOM.2014.105
• Michael Dinitz, Guy Kortsarz, and Zeev Nutov Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights 10.4230/LIPIcs.APPROX-RANDOM.2014.115
• Adrian Dumitrescu, Minghui Jiang, and Csaba D. Tóth Computing Opaque Interior Barriers à la Shermer 10.4230/LIPIcs.APPROX-RANDOM.2014.128
• Alina Ene and Jan Vondrák Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture 10.4230/LIPIcs.APPROX-RANDOM.2014.144
• Moran Feldman and Rani Izsak Constrained Monotone Function Maximization and the Supermodular Degree 10.4230/LIPIcs.APPROX-RANDOM.2014.160
• Andreas Emil Feldmann, Jochen Könemann, Neil Olver, and Laura Sanità On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree 10.4230/LIPIcs.APPROX-RANDOM.2014.176
• Michal Feldman, Nicole Immorlica, Brendan Lucier, and S. Matthew Weinberg Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks 10.4230/LIPIcs.APPROX-RANDOM.2014.192
• Takuro Fukunaga, Afshin Nikzad, and R. Ravi Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem 10.4230/LIPIcs.APPROX-RANDOM.2014.209
• Martin Gairing, Tobias Harks, and Max Klimm Complexity and Approximation of the Continuous Network Design Problem 10.4230/LIPIcs.APPROX-RANDOM.2014.226
• Christoph Hansknecht, Max Klimm, and Alexander Skopalik Approximate Pure Nash Equilibria in Weighted Congestion Games 10.4230/LIPIcs.APPROX-RANDOM.2014.242
• Nicholas J. A. Harvey, Roy Schwartz, and Mohit Singh Discrepancy Without Partial Colorings 10.4230/LIPIcs.APPROX-RANDOM.2014.258
• Shlomo Jozeph Universal Factor Graphs for Every NP-Hard Boolean CSP 10.4230/LIPIcs.APPROX-RANDOM.2014.274
• Jeremy A. Karp and R. Ravi A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs 10.4230/LIPIcs.APPROX-RANDOM.2014.284
• Stavros G. Kolliopoulos and Yannis Moysoglou Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location 10.4230/LIPIcs.APPROX-RANDOM.2014.297
• Tsz Chiu Kwok and Lap Chi Lau Lower Bounds on Expansions of Graph Powers 10.4230/LIPIcs.APPROX-RANDOM.2014.313
• Shanfei Li An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem 10.4230/LIPIcs.APPROX-RANDOM.2014.325
• Anand Louis and Yury Makarychev Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion 10.4230/LIPIcs.APPROX-RANDOM.2014.339
• Shashi Mittal, Andreas S. Schulz, and Sebastian Stiller Robust Appointment Scheduling 10.4230/LIPIcs.APPROX-RANDOM.2014.356
• Abhiram Natarajan and Yi Wu Computational Complexity of Certifying Restricted Isometry Property 10.4230/LIPIcs.APPROX-RANDOM.2014.371
• Prasad Raghavendra and Tselil Schramm Gap Amplification for Small-Set Expansion via Random Walks 10.4230/LIPIcs.APPROX-RANDOM.2014.381
• Alan J. Soper and Vitaly A. Strusevich Power of Preemption on Uniform Parallel Machines 10.4230/LIPIcs.APPROX-RANDOM.2014.392
• Chaitanya Swamy Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications 10.4230/LIPIcs.APPROX-RANDOM.2014.403
• Suguru Tamaki and Yuichi Yoshida Robust Approximation of Temporal CSP 10.4230/LIPIcs.APPROX-RANDOM.2014.419
• Cenny Wenner Parity is Positively Useless 10.4230/LIPIcs.APPROX-RANDOM.2014.433
• Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, and Dan Vilenchik The Condensation Phase Transition in Random Graph Coloring 10.4230/LIPIcs.APPROX-RANDOM.2014.449
• Eric Blais, Joshua Brody, and Badih Ghazi The Information Complexity of Hamming Distance 10.4230/LIPIcs.APPROX-RANDOM.2014.465
• Julia Böttcher, Jan Hladký, Diana Piguet, and Anusch Taraz An Approximate Version of the Tree Packing Conjecture via Random Embeddings 10.4230/LIPIcs.APPROX-RANDOM.2014.490
• Milan Bradonjic and Will Perkins On Sharp Thresholds in Random Geometric Graphs 10.4230/LIPIcs.APPROX-RANDOM.2014.500
• Gábor Braun, Samuel Fiorini, and Sebastian Pokutta Average Case Polyhedral Complexity of the Maximum Stable Set Problem 10.4230/LIPIcs.APPROX-RANDOM.2014.515
• Vladimir Braverman, Jonathan Katzman, Charles Seidell, and Gregory Vorsanger An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits 10.4230/LIPIcs.APPROX-RANDOM.2014.531
• Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, and Grigory Yaroslavtsev Certifying Equality With Limited Interaction 10.4230/LIPIcs.APPROX-RANDOM.2014.545
• Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, and Eric Vigoda #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region 10.4230/LIPIcs.APPROX-RANDOM.2014.582
• Arkadev Chattopadhyay and Michael E. Saks The Power of Super-logarithmic Number of Players 10.4230/LIPIcs.APPROX-RANDOM.2014.596
• Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, and Silvio Lattanzi On Reconstructing a Hidden Permutation 10.4230/LIPIcs.APPROX-RANDOM.2014.604
• Gil Cohen, Anat Ganor, and Ran Raz Two Sides of the Coin Problem 10.4230/LIPIcs.APPROX-RANDOM.2014.618
• Josep Díaz, Leslie Ann Goldberg, David Richerby, and Maria Serna Absorption Time of the Moran Process 10.4230/LIPIcs.APPROX-RANDOM.2014.630
• Chandan Dubey and Thomas Holenstein Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power 10.4230/LIPIcs.APPROX-RANDOM.2014.643
• Nathanaël François, Rahul Jain, and Frédéric Magniez Unidirectional Input/Output Streaming Complexity of Reversal and Sorting 10.4230/LIPIcs.APPROX-RANDOM.2014.654
• Hu Fu and Robert Kleinberg Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication 10.4230/LIPIcs.APPROX-RANDOM.2014.669
• Andreas Galanis, Daniel Stefankovic, Eric Vigoda, and Linji Yang Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results 10.4230/LIPIcs.APPROX-RANDOM.2014.677
• Anat Ganor and Ran Raz Space Pseudorandom Generators by Communication Complexity Lower Bounds 10.4230/LIPIcs.APPROX-RANDOM.2014.692
• Oded Goldreich On Multiple Input Problems in Property Testing 10.4230/LIPIcs.APPROX-RANDOM.2014.704
• Mika Göös and Thomas Watson Communication Complexity of Set-Disjointness for All Probabilities 10.4230/LIPIcs.APPROX-RANDOM.2014.721
• Alan Guo and Madhu Sudan List Decoding Group Homomorphisms Between Supersolvable Groups 10.4230/LIPIcs.APPROX-RANDOM.2014.737
• Venkatesan Guruswami and Carol Wang Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes 10.4230/LIPIcs.APPROX-RANDOM.2014.748
• T. S. Jayram and Jan Vondrák Exchangeability and Realizability: De Finetti Theorems on Graphs 10.4230/LIPIcs.APPROX-RANDOM.2014.762
• Varun Kanade, Elchanan Mossel, and Tselil Schramm Global and Local Information in Clustering Labeled Block Models 10.4230/LIPIcs.APPROX-RANDOM.2014.779
• Adam Klivans and Pravesh Kothari Embedding Hard Learning Problems Into Gaussian Space 10.4230/LIPIcs.APPROX-RANDOM.2014.793
• Michael Krivelevich, Daniel Reichman, and Wojciech Samotij Smoothed Analysis on Connected Graphs 10.4230/LIPIcs.APPROX-RANDOM.2014.810
• Reut Levi, Dana Ron, and Ronitt Rubinfeld Local Algorithms for Sparse Spanning Graphs 10.4230/LIPIcs.APPROX-RANDOM.2014.826
• Jingcheng Liu, Pinyan Lu, and Chihao Zhang The Complexity of Ferromagnetic Two-spin Systems with External Fields 10.4230/LIPIcs.APPROX-RANDOM.2014.843
• Abbas Mehrabian and Nick Wormald It’s a Small World for Random Surfers 10.4230/LIPIcs.APPROX-RANDOM.2014.857
• Raghu Meka, Omer Reingold, and Yuan Zhou Deterministic Coupon Collection and Better Strong Dispersers 10.4230/LIPIcs.APPROX-RANDOM.2014.872
• Thomas Steinke, Salil Vadhan, and Andrew Wan Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs 10.4230/LIPIcs.APPROX-RANDOM.2014.885