Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/approx/approx2017.bht:"
download as .bib file
@inproceedings{DBLP:conf/approx/0001FSS17,
author = {Xi Chen and
Adam Freilich and
Rocco A. Servedio and
Timothy Sun},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Sample-Based High-Dimensional Convexity Testing},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {37:1--37:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.37},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.37},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/0001FSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/0001STW17,
author = {Xi Chen and
Rocco A. Servedio and
Li{-}Yang Tan and
Erik Waingarten},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {38:1--38:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.38},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.38},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/0001STW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AcharyyaS17,
author = {Rupam Acharyya and
Daniel Stefankovic},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {23:1--23:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.23},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.23},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AcharyyaS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AgarwalCKM17,
author = {Naman Agarwal and
Karthekeyan Chandrasekaran and
Alexandra Kolla and
Vivek Madan},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {On the Expansion of Group-Based Lifts},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {24:1--24:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.24},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.24},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AgarwalCKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AlevL17,
author = {Vedat Levi Alev and
Lap Chi Lau},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Approximating Unique Games Using Low Diameter Graph Decomposition},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {18:1--18:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.18},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.18},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AlevL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AlonB17,
author = {Noga Alon and
Omri Ben{-}Eliezer},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Efficient Removal Lemmas for Matrices},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {25:1--25:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.25},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.25},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AlonB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AngelMP17,
author = {Omer Angel and
Abbas Mehrabian and
Yuval Peres},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {The String of Diamonds Is Tight for Rumor Spreading},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {26:1--26:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.26},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.26},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AngelMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AshlagiACCGKMWW17,
author = {Itai Ashlagi and
Yossi Azar and
Moses Charikar and
Ashish Chiplunkar and
Ofir Geri and
Haim Kaplan and
Rahul Makhijani and
Yuyi Wang and
Roger Wattenhofer},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Min-Cost Bipartite Perfect Matching with Delays},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {1:1--1:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.1},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AshlagiACCGKMWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AvronCW17,
author = {Haim Avron and
Kenneth L. Clarkson and
David P. Woodruff},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Sharper Bounds for Regularized Data Fitting},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {27:1--27:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.27},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.27},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AvronCW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BanksKM17,
author = {Jess Banks and
Robert Kleinberg and
Cristopher Moore},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {The Lov{\'{a}}sz Theta Function for Random Regular Graphs and
Community Detection in the Hard Regime},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {28:1--28:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.28},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.28},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BanksKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Ben-HamouP17,
author = {Anna Ben{-}Hamou and
Yuval Peres},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Cutoff for a Stratified Random Walk on the Hypercube},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {29:1--29:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.29},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.29},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Ben-HamouP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BercziCKLX17,
author = {Krist{\'{o}}f B{\'{e}}rczi and
Karthekeyan Chandrasekaran and
Tam{\'{a}}s Kir{\'{a}}ly and
Euiwoong Lee and
Chao Xu},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Global and Fixed-Terminal Cuts in Digraphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {2:1--2:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.2},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.2},
timestamp = {Wed, 18 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BercziCKLX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhattacharyyaGT17,
author = {Arnab Bhattacharyya and
Sivakanth Gopi and
Avishay Tal},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Lower Bounds for 2-Query LCCs over Large Alphabet},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {30:1--30:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.30},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.30},
timestamp = {Thu, 07 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/BhattacharyyaGT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhattiproluGL17,
author = {Vijay Bhattiprolu and
Venkatesan Guruswami and
Euiwoong Lee},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {31:1--31:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.31},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.31},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BhattiproluGL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlasiokDN17,
author = {Jaroslaw Blasiok and
Jian Ding and
Jelani Nelson},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Continuous Monitoring of l{\_}p Norms in Data Streams},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {32:1--32:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.32},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.32},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BlasiokDN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BorradaileZ17,
author = {Glencora Borradaile and
Baigong Zheng},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {A {PTAS} for Three-Edge-Connected Survivable Network Design in Planar
Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {3:1--3:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.3},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.3},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BorradaileZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Brakensiek17,
author = {Joshua Brakensiek},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Vertex Isoperimetry and Independent Set Stability for Tensor Powers
of Cliques},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {33:1--33:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.33},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.33},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Brakensiek17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BrakensiekG17,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {The Quest for Strong Inapproximability Results with Perfect Completeness},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {4:1--4:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.4},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.4},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BrakensiekG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CannonLS17,
author = {Sarah Cannon and
David A. Levin and
Alexandre Stauffer},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic
Tilings},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {34:1--34:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.34},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.34},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/CannonLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CarmosinoIKK17,
author = {Marco L. Carmosino and
Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Agnostic Learning from Tolerant Natural Proofs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {35:1--35:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.35},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.35},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/CarmosinoIKK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CelisDKSV17,
author = {L. Elisa Celis and
Amit Deshpande and
Tarun Kathuria and
Damian Straszak and
Nisheeth K. Vishnoi},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {On the Complexity of Constrained Determinantal Point Processes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {36:1--36:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.36},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.36},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/CelisDKSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChiesaMS17,
author = {Alessandro Chiesa and
Peter Manohar and
Igor Shinkar},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {On Axis-Parallel Tests for Tensor Product Codes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {39:1--39:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.39},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.39},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChiesaMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Coja-OghlanEJKK17,
author = {Amin Coja{-}Oghlan and
Charilaos Efthymiou and
Nor Jaafari and
Mihyun Kang and
Tobias Kapetanopoulos},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Charting the Replica Symmetric Phase},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {40:1--40:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.40},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.40},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/Coja-OghlanEJKK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DoronGT17,
author = {Dean Doron and
Fran{\c{c}}ois Le Gall and
Amnon Ta{-}Shma},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {41:1--41:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.41},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.41},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DoronGT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ErgunGAZ17,
author = {Funda Erg{\"{u}}n and
Elena Grigorescu and
Erfan Sadeqi Azer and
Samson Zhou},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Streaming Periodicity with Mismatches},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {42:1--42:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.42},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.42},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ErgunGAZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Frank-FischerGW17,
author = {S. Luna Frank{-}Fischer and
Venkatesan Guruswami and
Mary Wootters},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Locality via Partially Lifted Codes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {43:1--43:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.43},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.43},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Frank-FischerGW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FreitagPS17,
author = {Cody R. Freitag and
Eric Price and
William J. Swartworth},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Testing Hereditary Properties of Sequences},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {44:1--44:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.44},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.44},
timestamp = {Tue, 26 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/FreitagPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FriezeP17,
author = {Alan M. Frieze and
Wesley Pegden},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Traveling in Randomly Embedded Random Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {45:1--45:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.45},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.45},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/FriezeP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FriggstadGKMRRS17,
author = {Zachary Friggstad and
Arnoosh Golestanian and
Kamyar Khodamoradi and
Christopher S. Martin and
Mirmahdi Rahgoshay and
Mohsen Rezapour and
Mohammad R. Salavatipour and
Yifeng Zhang},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Scheduling Problems over Network of Machines},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {5:1--5:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.5},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/FriggstadGKMRRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GoemansU17,
author = {Michel X. Goemans and
Francisco Unda},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Approximating Incremental Combinatorial Optimization Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {6:1--6:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.6},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.6},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GoemansU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Golovnev0W17,
author = {Alexander Golovnev and
Oded Regev and
Omri Weinstein},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {The Minrank of Random Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {46:1--46:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.46},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.46},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Golovnev0W17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuptaK17,
author = {Anupam Gupta and
Archit Karandikar},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Stochastic Unsplittable Flows},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {7:1--7:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.7},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.7},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuptaK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiL17,
author = {Venkatesan Guruswami and
Ray Li},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Efficiently Decodable Codes for the Binary Deletion Channel},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {47:1--47:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.47},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.47},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiVV17,
author = {Venkatesan Guruswami and
Ameya Velingker and
Santhoshini Velusamy},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {8:1--8:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.8},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiVV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HaneyMMPRS17,
author = {Samuel Haney and
Bruce M. Maggs and
Biswaroop Maiti and
Debmalya Panigrahi and
Rajmohan Rajaraman and
Ravi Sundaram},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Symmetric Interdiction for Matching Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {9:1--9:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.9},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.9},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/HaneyMMPRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HarrisPST17,
author = {David G. Harris and
Thomas W. Pensyl and
Aravind Srinivasan and
Khoa Trinh},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {A Lottery Model for Center-Type Problems with Outliers},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {10:1--10:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.10},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.10},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/HarrisPST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HuangKY17,
author = {Chien{-}Chung Huang and
Naonori Kakimura and
Yuichi Yoshida},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Streaming Algorithms for Maximizing Monotone Submodular Functions
under a Knapsack Constraint},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {11:1--11:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.11},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.11},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/HuangKY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/IndykMRUVY17,
author = {Piotr Indyk and
Sepideh Mahabadi and
Ronitt Rubinfeld and
Jonathan R. Ullman and
Ali Vakilian and
Anak Yodpinyanee},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Fractional Set Cover in the Streaming Model},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {12:1--12:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.12},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.12},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/IndykMRUVY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/JansenKKL17,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Maria Kosche and
Leon Ladewig},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Online Strip Packing with Polynomial Migration},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {13:1--13:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.13},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.13},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/JansenKKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/JindalKPS17,
author = {Gorav Jindal and
Pavel Kolev and
Richard Peng and
Saurabh Sawlani},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Density Independent Algorithms for Sparsifying k-Step Random Walks},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {14:1--14:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.14},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.14},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/JindalKPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KaleT17,
author = {Sagar Kale and
Sumedh Tirodkar},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {15:1--15:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.15},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.15},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KaleT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KesselheimT17,
author = {Thomas Kesselheim and
Andreas T{\"{o}}nnis},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {16:1--16:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.16},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.16},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KesselheimT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KonemannOP0SV17,
author = {Jochen K{\"{o}}nemann and
Neil Olver and
Kanstantsin Pashkovich and
R. Ravi and
Chaitanya Swamy and
Jens Vygen},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {On the Integrality Gap of the Prize-Collecting Steiner Forest {LP}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {17:1--17:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.17},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.17},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KonemannOP0SV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LibertyS17,
author = {Edo Liberty and
Maxim Sviridenko},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Greedy Minimization of Weakly Supermodular Set Functions},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {19:1--19:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.19},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.19},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/LibertyS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ObremskiS17,
author = {Maciej Obremski and
Maciej Skorski},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Renyi Entropy Estimation Revisited},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {20:1--20:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.20},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ObremskiS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RabaniV17,
author = {Yuval Rabani and
Rakesh Venkat},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Approximating Sparsest Cut in Low Rank Graphs via Embeddings from
Approximately Low Dimensional Spaces},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {21:1--21:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.21},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.21},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/RabaniV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RoughgardenTV17,
author = {Tim Roughgarden and
Inbal Talgam{-}Cohen and
Jan Vondr{\'{a}}k},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {When Are Welfare Guarantees Robust?},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {22:1--22:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.22},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.22},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/RoughgardenTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Volkovich17,
author = {Ilya Volkovich},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {On Some Computations on Sparse Polynomials},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {48:1--48:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.48},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.48},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Volkovich17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Watson17,
author = {Thomas Watson},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Communication Complexity of Statistical Distance},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {49:1--49:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.49},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.49},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Watson17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/X17,
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Frontmatter, Table of Contents, Preface, Organization, External Reviewers,
List of Authors},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {0:1--0:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.0},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.0},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/X17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2017,
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-044-6},
isbn = {978-3-95977-044-6},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-24 13:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
