@Proceedings{jansen_et_al:LIPIcs.APPROX-RANDOM.2016,
title = {{LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016},
URN = {urn:nbn:de:0030-drops-66809},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016},
annote = {Keywords: Theory of Computation, Models of Computation, Modes of Computation – Online Computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems – Computations on Matrices, Nonnumerical Algorithms and Problems}
}
@InProceedings{jansen_et_al:LIPIcs.APPROX-RANDOM.2016.0,
author = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
title = {{Front Matter, Table of Contents, Preface, Program Committees, External Reviewers, List of Authors}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.0},
URN = {urn:nbn:de:0030-drops-66235},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Program Committees, External Reviewers, List of Authors}
}
@InProceedings{backurs_et_al:LIPIcs.APPROX-RANDOM.2016.1,
author = {Backurs, Arturs and Sidiropoulos, Anastasios},
title = {{Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l\underlinep Spaces}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {1:1--1:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.1},
URN = {urn:nbn:de:0030-drops-66241},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.1},
annote = {Keywords: metric embeddings, Hausdorff metric, distortion, dimension}
}
@InProceedings{basu_et_al:LIPIcs.APPROX-RANDOM.2016.2,
author = {Basu, Amitabh and Dinitz, Michael and Li, Xin},
title = {{Computing Approximate PSD Factorizations}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {2:1--2:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.2},
URN = {urn:nbn:de:0030-drops-66258},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.2},
annote = {Keywords: PSD rank, PSD factorizations}
}
@InProceedings{bliznets_et_al:LIPIcs.APPROX-RANDOM.2016.3,
author = {Bliznets, Ivan and Cygan, Marek and Komosa, Pawel and Pilipczuk, Michal},
title = {{Hardness of Approximation for H-Free Edge Modification Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {3:1--3:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.3},
URN = {urn:nbn:de:0030-drops-66260},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.3},
annote = {Keywords: hardness of approximation, parameterized complexity, kernelization, edge modification problems}
}
@InProceedings{charikar_et_al:LIPIcs.APPROX-RANDOM.2016.4,
author = {Charikar, Moses and Naamad, Yonatan and Wirth, Anthony},
title = {{On Approximating Target Set Selection}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {4:1--4:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.4},
URN = {urn:nbn:de:0030-drops-66274},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.4},
annote = {Keywords: target set selection, influence propagation, approximation algorithms, hardness of approximation, planted dense subgraph}
}
@InProceedings{chen_et_al:LIPIcs.APPROX-RANDOM.2016.5,
author = {Chen, Lin and Ye, Deshi and Zhang, Guochuan},
title = {{Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {5:1--5:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.5},
URN = {urn:nbn:de:0030-drops-66283},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.5},
annote = {Keywords: approximation algorithms, scheduling, linear programming}
}
@InProceedings{chlamtac_et_al:LIPIcs.APPROX-RANDOM.2016.6,
author = {Chlamtac, Eden and Dinitz, Michael and Konrad, Christian and Kortsarz, Guy and Rabanca, George},
title = {{The Densest k-Subhypergraph Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {6:1--6:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.6},
URN = {urn:nbn:de:0030-drops-66298},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.6},
annote = {Keywords: Hypergraphs, Approximation algorithms}
}
@InProceedings{cohen_et_al:LIPIcs.APPROX-RANDOM.2016.7,
author = {Cohen, Michael B. and Musco, Cameron and Pachocki, Jakub},
title = {{Online Row Sampling}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {7:1--7:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.7},
URN = {urn:nbn:de:0030-drops-66304},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.7},
annote = {Keywords: spectral sparsification, leverage score sampling, online sparsification}
}
@InProceedings{feige_et_al:LIPIcs.APPROX-RANDOM.2016.8,
author = {Feige, Uriel and Feldman, Michal and Talgam-Cohen, Inbal},
title = {{Oblivious Rounding and the Integrality Gap}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {8:1--8:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.8},
URN = {urn:nbn:de:0030-drops-66319},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.8},
annote = {Keywords: Welfare-maximization}
}
@InProceedings{halman:LIPIcs.APPROX-RANDOM.2016.9,
author = {Halman, Nir},
title = {{A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {9:1--9:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.9},
URN = {urn:nbn:de:0030-drops-66327},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.9},
annote = {Keywords: Approximate counting, integer knapsack, dynamic programming, bounding constraints, \$K\$-approximating sets and functions}
}
@InProceedings{im_et_al:LIPIcs.APPROX-RANDOM.2016.10,
author = {Im, Sungjin and Kulkarni, Janardhan and Moseley, Benjamin and Munagala, Kamesh},
title = {{A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.10},
URN = {urn:nbn:de:0030-drops-66336},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.10},
annote = {Keywords: Polytope constraints, average flow time, multi-clusters, online scheduling, and competitive analysis}
}
@InProceedings{khuller_et_al:LIPIcs.APPROX-RANDOM.2016.11,
author = {Khuller, Samir and Yang, Sheng},
title = {{Revisiting Connected Dominating Sets: An Optimal Local Algorithm?}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {11:1--11:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.11},
URN = {urn:nbn:de:0030-drops-66340},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.11},
annote = {Keywords: graph algorithms, approximation algorithms, dominating sets, local information algorithms}
}
@InProceedings{kim_et_al:LIPIcs.APPROX-RANDOM.2016.12,
author = {Kim, Anthony and Liaghat, Vahid and Qin, Junjie and Saberi, Amin},
title = {{Online Energy Storage Management: an Algorithmic Approach}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {12:1--12:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.12},
URN = {urn:nbn:de:0030-drops-66355},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.12},
annote = {Keywords: Online Algorithms, Competitive Analysis, Routing, Storage, Approximation Algorithms, Power Control}
}
@InProceedings{kortsarz_et_al:LIPIcs.APPROX-RANDOM.2016.13,
author = {Kortsarz, Guy and Nutov, Zeev},
title = {{LP-Relaxations for Tree Augmentation}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.13},
URN = {urn:nbn:de:0030-drops-66366},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.13},
annote = {Keywords: Tree Augmentation; LP-relaxation; Laminar family; Approximation algorithms}
}
@InProceedings{makarychev_et_al:LIPIcs.APPROX-RANDOM.2016.14,
author = {Makarychev, Konstantin and Makarychev, Yury and Sviridenko, Maxim and Ward, Justin},
title = {{A Bi-Criteria Approximation Algorithm for k-Means}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {14:1--14:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.14},
URN = {urn:nbn:de:0030-drops-66370},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.14},
annote = {Keywords: k-means clustering, bicriteria approximation algorithms, linear programming, local search}
}
@InProceedings{manurangsi_et_al:LIPIcs.APPROX-RANDOM.2016.15,
author = {Manurangsi, Pasin and Nakkiran, Preetum and Trevisan, Luca},
title = {{Near-Optimal UGC-hardness of Approximating Max k-CSP\underlineR}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {15:1--15:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.15},
URN = {urn:nbn:de:0030-drops-66388},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.15},
annote = {Keywords: inapproximability, unique games conjecture, constraint satisfaction problem, invariance principle}
}
@InProceedings{marx_et_al:LIPIcs.APPROX-RANDOM.2016.16,
author = {Marx, D\'{a}niel and Salmasi, Ario and Sidiropoulos, Anastasios},
title = {{Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {16:1--16:54},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.16},
URN = {urn:nbn:de:0030-drops-66391},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.16},
annote = {Keywords: asymmetric TSP, approximation algorithms, nearly-embeddable graphs, Held-Karp LP, exponential time hypothesis}
}
@InProceedings{mcgregor_et_al:LIPIcs.APPROX-RANDOM.2016.17,
author = {McGregor, Andrew and Vorotnikova, Sofya},
title = {{Planar Matching in Streams Revisited}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {17:1--17:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.17},
URN = {urn:nbn:de:0030-drops-66407},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.17},
annote = {Keywords: data streams, planar graphs, arboricity, matchings}
}
@InProceedings{raghvendra:LIPIcs.APPROX-RANDOM.2016.18,
author = {Raghvendra, Sharath},
title = {{A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.18},
URN = {urn:nbn:de:0030-drops-66410},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.18},
annote = {Keywords: Online Algorithms, Metric Bipartite Matching}
}
@InProceedings{stephensdavidowitz:LIPIcs.APPROX-RANDOM.2016.19,
author = {Stephens-Davidowitz, Noah},
title = {{Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {19:1--19:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.19},
URN = {urn:nbn:de:0030-drops-66421},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.19},
annote = {Keywords: Lattices, SVP, CVP}
}
@InProceedings{syed_et_al:LIPIcs.APPROX-RANDOM.2016.20,
author = {Syed, Ridwan and Tulsiani, Madhur},
title = {{Proving Weak Approximability Without Algorithms}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {20:1--20:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.20},
URN = {urn:nbn:de:0030-drops-66437},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.20},
annote = {Keywords: approximability, constraint satisfaction problems, approximation resistance, linear programming, semidefinite programming}
}
@InProceedings{babu_et_al:LIPIcs.APPROX-RANDOM.2016.21,
author = {Babu, Jasine and Khoury, Areej and Newman, Ilan},
title = {{Every Property of Outerplanar Graphs is Testable}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {21:1--21:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.21},
URN = {urn:nbn:de:0030-drops-66448},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.21},
annote = {Keywords: Property testing, Isomorphism, Outerplanar graphs}
}
@InProceedings{bapst_et_al:LIPIcs.APPROX-RANDOM.2016.22,
author = {Bapst, Victor and Coja-Oghlan, Amin},
title = {{The Condensation Phase Transition in the Regular k-SAT Model}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.22},
URN = {urn:nbn:de:0030-drops-66452},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.22},
annote = {Keywords: random k-SAT, phase transitions, Belief Propagation, condensation}
}
@InProceedings{bhattacharyya_et_al:LIPIcs.APPROX-RANDOM.2016.23,
author = {Bhattacharyya, Arnab and Bhowmick, Abhishek and Gupta, Chetan},
title = {{On Higher-Order Fourier Analysis over Non-Prime Fields}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {23:1--23:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.23},
URN = {urn:nbn:de:0030-drops-66463},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.23},
annote = {Keywords: finite fields, higher order fourier analysis, coding theory, property testing}
}
@InProceedings{boppana_et_al:LIPIcs.APPROX-RANDOM.2016.24,
author = {Boppana, Ravi and H\r{a}stad, Johan and Lee, Chin Ho and Viola, Emanuele},
title = {{Bounded Independence vs. Moduli}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {24:1--24:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.24},
URN = {urn:nbn:de:0030-drops-66475},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.24},
annote = {Keywords: Bounded independence, Modulus}
}
@InProceedings{braverman_et_al:LIPIcs.APPROX-RANDOM.2016.25,
author = {Braverman, Vladimir and Roytman, Alan and Vorsanger, Gregory},
title = {{Approximating Subadditive Hadamard Functions on Implicit Matrices}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {25:1--25:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.25},
URN = {urn:nbn:de:0030-drops-66483},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.25},
annote = {Keywords: Streaming Algorithms, Measuring Independence, Hadamard Functions, Implicit Matrices}
}
@InProceedings{chapuy_et_al:LIPIcs.APPROX-RANDOM.2016.26,
author = {Chapuy, Guillaume and Perarnau, Guillem},
title = {{Local Convergence and Stability of Tight Bridge-Addable Graph Classes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {26:1--26:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.26},
URN = {urn:nbn:de:0030-drops-66494},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.26},
annote = {Keywords: bridge-addable classes, random graphs, stability, local convergence, random forests}
}
@InProceedings{cojaoghlan_et_al:LIPIcs.APPROX-RANDOM.2016.27,
author = {Coja-Oghlan, Amin and Perkins, Will},
title = {{Belief Propagation on Replica Symmetric Random Factor Graph Models}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {27:1--27:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.27},
URN = {urn:nbn:de:0030-drops-66500},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.27},
annote = {Keywords: Gibbs distributions, Belief Propagation, Bethe Free Energy, Random k-SAT}
}
@InProceedings{dadush_et_al:LIPIcs.APPROX-RANDOM.2016.28,
author = {Dadush, Daniel and Garg, Shashwat and Lovett, Shachar and Nikolov, Aleksandar},
title = {{Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {28:1--28:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.28},
URN = {urn:nbn:de:0030-drops-66512},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.28},
annote = {Keywords: Discrepancy, Vector Balancing, Convex Geometry}
}
@InProceedings{ezra_et_al:LIPIcs.APPROX-RANDOM.2016.29,
author = {Ezra, Esther and Lovett, Shachar},
title = {{On the Beck-Fiala Conjecture for Random Set Systems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {29:1--29:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.29},
URN = {urn:nbn:de:0030-drops-66526},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.29},
annote = {Keywords: Discrepancy theory, Beck-Fiala conjecture, Random set systems}
}
@InProceedings{gartner_et_al:LIPIcs.APPROX-RANDOM.2016.30,
author = {G\"{a}rtner, Bernd and Thomas, Antonis},
title = {{The Niceness of Unique Sink Orientations}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {30:1--30:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.30},
URN = {urn:nbn:de:0030-drops-66538},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.30},
annote = {Keywords: random edge, unique sink orientation, random walk, reachmap, niceness}
}
@InProceedings{guo_et_al:LIPIcs.APPROX-RANDOM.2016.31,
author = {Guo, Heng and Lu, Pinyan},
title = {{Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {31:1--31:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.31},
URN = {urn:nbn:de:0030-drops-66547},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.31},
annote = {Keywords: Approximate counting; Ising model; Spin systems; Correlation decay}
}
@InProceedings{harsha_et_al:LIPIcs.APPROX-RANDOM.2016.32,
author = {Harsha, Prahladh and Srinivasan, Srikanth},
title = {{On Polynomial Approximations to AC^0}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.32},
URN = {urn:nbn:de:0030-drops-66550},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.32},
annote = {Keywords: Constant-depth Boolean circuits, Polynomials over reals, pseudo-random generators, k-wise independence}
}
@InProceedings{hatami:LIPIcs.APPROX-RANDOM.2016.33,
author = {Hatami, Pooya},
title = {{On the Structure of Quintic Polynomials}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {33:1--33:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.33},
URN = {urn:nbn:de:0030-drops-66569},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.33},
annote = {Keywords: Higher-order Fourier analysis, Structure Theorem, Polynomials, Regularity lemmas}
}
@InProceedings{hazla_et_al:LIPIcs.APPROX-RANDOM.2016.34,
author = {Hazla, Jan and Holenstein, Thomas and Mossel, Elchanan},
title = {{Lower Bounds on Same-Set Inner Product in Correlated Spaces}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {34:1--34:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.34},
URN = {urn:nbn:de:0030-drops-66571},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.34},
annote = {Keywords: same set hitting, product spaces, correlation, lower bounds}
}
@InProceedings{hoppen_et_al:LIPIcs.APPROX-RANDOM.2016.35,
author = {Hoppen, Carlos and Kohayakawa, Yoshiharu and Lang, Richard and Lefmann, Hanno and Stagni, Henrique},
title = {{Estimating Parameters Associated with Monotone Properties}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {35:1--35:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.35},
URN = {urn:nbn:de:0030-drops-66588},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.35},
annote = {Keywords: parameter estimation, parameter testing, edit distance to monotone graph properties, entropy of subgraph classes, speed of subgraph classes}
}
@InProceedings{kanade_et_al:LIPIcs.APPROX-RANDOM.2016.36,
author = {Kanade, Varun and Leonardos, Nikos and Magniez, Fr\'{e}d\'{e}ric},
title = {{Stable Matching with Evolving Preferences}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {36:1--36:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.36},
URN = {urn:nbn:de:0030-drops-66597},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.36},
annote = {Keywords: Stable Matching, Dynamic Data}
}
@InProceedings{khot_et_al:LIPIcs.APPROX-RANDOM.2016.37,
author = {Khot, Subhash and Shinkar, Igor},
title = {{An \textasciitildeO(n) Queries Adaptive Tester for Unateness}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {37:1--37:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.37},
URN = {urn:nbn:de:0030-drops-66603},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.37},
annote = {Keywords: property testing, boolean functions, unateness}
}
@InProceedings{levi_et_al:LIPIcs.APPROX-RANDOM.2016.38,
author = {Levi, Reut and Ron, Dana and Rubinfeld, Ronitt},
title = {{A Local Algorithm for Constructing Spanners in Minor-Free Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {38:1--38:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.38},
URN = {urn:nbn:de:0030-drops-66613},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.38},
annote = {Keywords: spanners, sparse subgraphs, local algorithms, excluded-minor}
}
@InProceedings{li_et_al:LIPIcs.APPROX-RANDOM.2016.39,
author = {Li, Yi and Woodruff, David P.},
title = {{Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {39:1--39:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.39},
URN = {urn:nbn:de:0030-drops-66620},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.39},
annote = {Keywords: data streams, sketching, matrix norms, subspace embeddings}
}
@InProceedings{medarametla_et_al:LIPIcs.APPROX-RANDOM.2016.40,
author = {Medarametla, Dhruv and Potechin, Aaron},
title = {{Bounds on the Norms of Uniform Low Degree Graph Matrices}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {40:1--40:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.40},
URN = {urn:nbn:de:0030-drops-66638},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.40},
annote = {Keywords: sum of squares hierarchy, matrix norm bounds}
}
@InProceedings{mori_et_al:LIPIcs.APPROX-RANDOM.2016.41,
author = {Mori, Ryuhei and Witmer, David},
title = {{Lower Bounds for CSP Refutation by SDP Hierarchies}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {41:1--41:30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.41},
URN = {urn:nbn:de:0030-drops-66645},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.41},
annote = {Keywords: constraint satisfaction problems, LP and SDP relaxations, average-case complexity}
}
@InProceedings{moshkovitz_et_al:LIPIcs.APPROX-RANDOM.2016.42,
author = {Moshkovitz, Dana and Ramnarayan, Govind and Yuen, Henry},
title = {{A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {42:1--42:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.42},
URN = {urn:nbn:de:0030-drops-66657},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.42},
annote = {Keywords: Derandomization, parallel repetition, Feige-Killian, fortification}
}
@InProceedings{nicaud:LIPIcs.APPROX-RANDOM.2016.43,
author = {Nicaud, Cyril},
title = {{Fast Synchronization of Random Automata}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {43:1--43:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.43},
URN = {urn:nbn:de:0030-drops-66665},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.43},
annote = {Keywords: random automata, synchronization, the \v{C}ern\'{y} conjecture}
}
@InProceedings{rao_et_al:LIPIcs.APPROX-RANDOM.2016.44,
author = {Rao, Anup and Sinha, Makrand},
title = {{A Direct-Sum Theorem for Read-Once Branching Programs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {44:1--44:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.44},
URN = {urn:nbn:de:0030-drops-66676},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.44},
annote = {Keywords: Direct-sum, Information complexity, Streaming Algorithms}
}
@InProceedings{shaltiel_et_al:LIPIcs.APPROX-RANDOM.2016.45,
author = {Shaltiel, Ronen and Silbak, Jad},
title = {{Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {45:1--45:38},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.45},
URN = {urn:nbn:de:0030-drops-66682},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.45},
annote = {Keywords: Error Correcting Codes, List Decoding, Pseudorandomness}
}
@InProceedings{song_et_al:LIPIcs.APPROX-RANDOM.2016.46,
author = {Song, Renjie and Yin, Yitong and Zhao, Jinman},
title = {{Counting Hypergraph Matchings up to Uniqueness Threshold}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {46:1--46:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.46},
URN = {urn:nbn:de:0030-drops-66690},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.46},
annote = {Keywords: approximate counting; phase transition; spatial mixing}
}
@InProceedings{yin_et_al:LIPIcs.APPROX-RANDOM.2016.47,
author = {Yin, Yitong and Zhang, Chihao},
title = {{Sampling in Potts Model on Sparse Random Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {47:1--47:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.47},
URN = {urn:nbn:de:0030-drops-66706},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.47},
annote = {Keywords: Potts model, Sampling, Random Graph, Approximation Algorithm}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing