1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@Proceedings{seidel:OASIcs.SOSA.2018, title = {{OASIcs, Volume 61, SOSA'18, Complete Volume}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018}, URN = {urn:nbn:de:0030-drops-84405}, doi = {10.4230/OASIcs.SOSA.2018}, annote = {Keywords: Algorithm design and analysis} }
1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{seidel:OASIcs.SOSA.2018.0, author = {Seidel, Raimund}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {0:i--0:xii}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.0}, URN = {urn:nbn:de:0030-drops-82942}, doi = {10.4230/OASIcs.SOSA.2018.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Yixin Cao. A Naive Algorithm for Feedback Vertex Set. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 1:1-1:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cao:OASIcs.SOSA.2018.1, author = {Cao, Yixin}, title = {{A Naive Algorithm for Feedback Vertex Set}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {1:1--1:9}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.1}, URN = {urn:nbn:de:0030-drops-82961}, doi = {10.4230/OASIcs.SOSA.2018.1}, annote = {Keywords: greedy algorithm, analysis of algorithms, branching algorithm, parameterized computation -- graph modification problem} }
Chandra Chekuri and Thapanapong Rukkanchanunt. A Note on Iterated Rounding for the Survivable Network Design Problem. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 2:1-2:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chekuri_et_al:OASIcs.SOSA.2018.2, author = {Chekuri, Chandra and Rukkanchanunt, Thapanapong}, title = {{A Note on Iterated Rounding for the Survivable Network Design Problem}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {2:1--2:10}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.2}, URN = {urn:nbn:de:0030-drops-82976}, doi = {10.4230/OASIcs.SOSA.2018.2}, annote = {Keywords: survivable network design, iterated rounding, approximation, element connectivity} }
Chandra Chekuri and Mark Idleman. Congestion Minimization for Multipath Routing via Multiroute Flows. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 3:1-3:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chekuri_et_al:OASIcs.SOSA.2018.3, author = {Chekuri, Chandra and Idleman, Mark}, title = {{Congestion Minimization for Multipath Routing via Multiroute Flows}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {3:1--3:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.3}, URN = {urn:nbn:de:0030-drops-82984}, doi = {10.4230/OASIcs.SOSA.2018.3}, annote = {Keywords: multipath routing, congestion minimization, multiroute flows} }
Deeparnab Chakrabarty and Sanjeev Khanna. Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 4:1-4:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chakrabarty_et_al:OASIcs.SOSA.2018.4, author = {Chakrabarty, Deeparnab and Khanna, Sanjeev}, title = {{Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {4:1--4:11}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.4}, URN = {urn:nbn:de:0030-drops-83045}, doi = {10.4230/OASIcs.SOSA.2018.4}, annote = {Keywords: Matrix Scaling, Entropy Minimization, KL Divergence Inequalities} }
Timothy M. Chan. Approximation Schemes for 0-1 Knapsack. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 5:1-5:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chan:OASIcs.SOSA.2018.5, author = {Chan, Timothy M.}, title = {{Approximation Schemes for 0-1 Knapsack}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {5:1--5:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.5}, URN = {urn:nbn:de:0030-drops-82994}, doi = {10.4230/OASIcs.SOSA.2018.5}, annote = {Keywords: knapsack problem, approximation algorithms, optimization, (min,+)-convolution} }
R. Ryan Williams. Counting Solutions to Polynomial Systems via Reductions. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{williams:OASIcs.SOSA.2018.6, author = {Williams, R. Ryan}, title = {{Counting Solutions to Polynomial Systems via Reductions}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {6:1--6:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.6}, URN = {urn:nbn:de:0030-drops-83078}, doi = {10.4230/OASIcs.SOSA.2018.6}, annote = {Keywords: counting complexity, polynomial equations, finite field, derandomization, strong exponential time hypothesis} }
Talya Eden and Will Rosenbaum. On Sampling Edges Almost Uniformly. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 7:1-7:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{eden_et_al:OASIcs.SOSA.2018.7, author = {Eden, Talya and Rosenbaum, Will}, title = {{On Sampling Edges Almost Uniformly}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {7:1--7:9}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.7}, URN = {urn:nbn:de:0030-drops-83001}, doi = {10.4230/OASIcs.SOSA.2018.7}, annote = {Keywords: Sublinear Algorithms, Graph Algorithms, Sampling Edges, Query Complexity} }
Allan Borodin, Denis Pankratov, and Amirali Salehi-Abari. A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 8:1-8:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{borodin_et_al:OASIcs.SOSA.2018.8, author = {Borodin, Allan and Pankratov, Denis and Salehi-Abari, Amirali}, title = {{A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {8:1--8:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.8}, URN = {urn:nbn:de:0030-drops-83033}, doi = {10.4230/OASIcs.SOSA.2018.8}, annote = {Keywords: dual bin packing, PTAS, tape-advice complexity} }
Petra Berenbrink, Dominik Kaaser, Peter Kling, and Lena Otterbach. Simple and Efficient Leader Election. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 9:1-9:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{berenbrink_et_al:OASIcs.SOSA.2018.9, author = {Berenbrink, Petra and Kaaser, Dominik and Kling, Peter and Otterbach, Lena}, title = {{Simple and Efficient Leader Election}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {9:1--9:11}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.9}, URN = {urn:nbn:de:0030-drops-83029}, doi = {10.4230/OASIcs.SOSA.2018.9}, annote = {Keywords: population protocols, leader election, distributed, randomized} }
Tsvi Kopelowitz and Ely Porat. A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 10:1-10:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kopelowitz_et_al:OASIcs.SOSA.2018.10, author = {Kopelowitz, Tsvi and Porat, Ely}, title = {{A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {10:1--10:5}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.10}, URN = {urn:nbn:de:0030-drops-83089}, doi = {10.4230/OASIcs.SOSA.2018.10}, annote = {Keywords: Pattern Matching, Hamming Distance, Approximation Algorithms} }
Klaus Jansen and Lars Rohwedder. Compact LP Relaxations for Allocation Problems. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 11:1-11:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jansen_et_al:OASIcs.SOSA.2018.11, author = {Jansen, Klaus and Rohwedder, Lars}, title = {{Compact LP Relaxations for Allocation Problems}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {11:1--11:19}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.11}, URN = {urn:nbn:de:0030-drops-83012}, doi = {10.4230/OASIcs.SOSA.2018.11}, annote = {Keywords: Linear programming, unrelated machines, makespan, max-min, restricted assignment, santa claus} }
Divesh Aggarwal and Noah Stephens-Davidowitz. Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP). In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 12:1-12:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{aggarwal_et_al:OASIcs.SOSA.2018.12, author = {Aggarwal, Divesh and Stephens-Davidowitz, Noah}, title = {{Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP)}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {12:1--12:19}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.12}, URN = {urn:nbn:de:0030-drops-83062}, doi = {10.4230/OASIcs.SOSA.2018.12}, annote = {Keywords: Lattices, SVP, CVP} }
Alantha Newman. Complex Semidefinite Programming and Max-k-Cut. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 13:1-13:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{newman:OASIcs.SOSA.2018.13, author = {Newman, Alantha}, title = {{Complex Semidefinite Programming and Max-k-Cut}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {13:1--13:11}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.13}, URN = {urn:nbn:de:0030-drops-83098}, doi = {10.4230/OASIcs.SOSA.2018.13}, annote = {Keywords: Graph Partitioning, Max-k-Cut, Semidefinite Programming} }
Andrew McGregor and Sofya Vorotnikova. A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 14:1-14:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{mcgregor_et_al:OASIcs.SOSA.2018.14, author = {McGregor, Andrew and Vorotnikova, Sofya}, title = {{A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {14:1--14:4}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.14}, URN = {urn:nbn:de:0030-drops-82959}, doi = {10.4230/OASIcs.SOSA.2018.14}, annote = {Keywords: data streams, matching, planar graphs, arboricity} }
Michael B. Cohen, T.S. Jayram, and Jelani Nelson. Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 15:1-15:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cohen_et_al:OASIcs.SOSA.2018.15, author = {Cohen, Michael B. and Jayram, T.S. and Nelson, Jelani}, title = {{Simple Analyses of the Sparse Johnson-Lindenstrauss Transform}}, booktitle = {1st Symposium on Simplicity in Algorithms (SOSA 2018)}, pages = {15:1--15:9}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-064-4}, ISSN = {2190-6807}, year = {2018}, volume = {61}, editor = {Seidel, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.15}, URN = {urn:nbn:de:0030-drops-83056}, doi = {10.4230/OASIcs.SOSA.2018.15}, annote = {Keywords: dimensionality reduction, Johnson-Lindenstrauss, Sparse Johnson-Lindenstrauss Transform} }