Filters








11 Hits in 8.1 sec

Scheduling (Dagstuhl Seminar 20081)

Nicole Megow, David Shmoys, Ola Svensson
2020 Dagstuhl Reports  
The seminar focused on the interplay between scheduling problems and problems that arise in the management of transportation and traffic.  ...  This report documents the program and the outcomes of Dagstuhl Seminar 20081 "Scheduling".  ...  The authors believe that the same instance used is the right one for showing an integrality gap for P 2|prec|C max .  ... 
doi:10.4230/dagrep.10.2.50 dblp:journals/dagstuhl-reports/MegowSS20 fatcat:dtrzez6ogbhdjc56hbnv3hyuhy

Online Graph Algorithms with Predictions [article]

Yossi Azar, Debmalya Panigrahi, Noam Touitou
2021 arXiv   pre-print
To the best of our knowledge, this is the first general-purpose tool for obtaining online algorithms with predictions. * Using our framework, we obtain tight bounds on the competitive ratio of several  ...  one of the two error types. * We give a general framework for obtaining online algorithms with predictions that combines, in a "black box" fashion, existing online and offline algorithms, under certain  ...  In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 1834– 1845.  ... 
arXiv:2112.11831v1 fatcat:zhpmzfmaujdd3hxithezyfjvsq

Orienting (hyper)graphs under explorable stochastic uncertainty [article]

Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
2021 arXiv   pre-print
Using competitive analysis, we compare the expected query cost of an algorithm with the expected cost of an optimal query set for the given instance.  ...  For the general case, we give a polynomial-time f(α)-competitive algorithm, where f(α)∈ [1.618+ϵ,2] depends on the approximation ratio α for an underlying vertex cover problem.  ...  In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 2916-2935.  ... 
arXiv:2107.00572v1 fatcat:3xx6573zwzcc5ekoqcfwxy3ipq

Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary [article]

Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert
2022 arXiv   pre-print
Designing dynamic algorithms against an adaptive adversary whose performance match the ones assuming an oblivious adversary is a major research program in the field of dynamic graph algorithms.  ...  we allow infinite time and only count recourse (i.e. the number of edge changes per update in the maintained spanner), all previous algorithms with stretch at most log^5(n) require at least Ω(n) amortized  ...  polylog incremental spqr-trees: Embeddings, planarity, and triconnectivity.In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020,  ... 
arXiv:2207.04954v1 fatcat:5xlrgo3yizg55gglswz2k2h24a

Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits

Timothée Goubault De Brugière, Marc Baboulin, Benoît Valiron, Simon Martiel, Cyril Allouche
2021 ACM Transactions on Quantum Computing  
Overall, on random operators, our algorithms improve the state-of-the-art methods for specific ranges of problem sizes: The custom Gaussian elimination algorithm provides the best results for large problem  ...  On a benchmark of reversible functions, we manage to significantly reduce the CNOT count and the depth of the circuit while keeping other metrics of importance (T-count, T-depth) as low as possible.  ...  In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020 (2020), S.  ... 
doi:10.1145/3474226 fatcat:dcldbikaxbhd5iafpbbojvttge

PFP Data Structures [article]

Christina Boucher, Ondřej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi
2020 arXiv   pre-print
Lastly, we provide experimental evidence that the PFP data structure can be efficiently constructed for very large repetitive datasets: it takes one hour and 54 GB peak memory for 1000 variants of human  ...  Prefix-free parsing (PFP) was introduced by Boucher et al. (2019) as a preprocessing step to ease the computation of Burrows-Wheeler Transforms (BWTs) of genomic databases.  ...  On the other hand, on Salmonella dataset, sdsl.cst is faster than pfp.ds on SA queries and LCP queries for more than 100 genomes.  ... 
arXiv:2006.11687v1 fatcat:j4uggia2rbezliuf54z5smz3ku

Maximum Weight b-Matchings in Random-Order Streams [article]

Chien-Chung Huang, François Sellier
2022 arXiv   pre-print
Assuming all weights are small integers drawn from [1,W], we present a 2 - 1/2W + ε approximation algorithm, using a memory of O(max(|M_G|, n) · poly(log(m),W,1/ε)), where |M_G| denotes the cardinality  ...  of the optimal matching.  ...  In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 1773-1785.  ... 
arXiv:2207.03863v2 fatcat:i73uvqh2zffhtkm2plfm6ncno4

Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching [article]

Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian
2022 arXiv   pre-print
These results improve upon the previous best runtime of Õ(m ·ϵ^-4) [BGS20] and illustrate the utility of using regularized optimization problem solvers for designing dynamic algorithms.  ...  We further show how to use recent advances in flow optimization [CKL+22] to improve our runtime to m^1 + o(1)·ϵ^-2, thereby demonstrating the versatility of our reduction-based approach.  ...  of Sinkhorn's algorithm (in the original submission, we claimed no such rate had been stated previously), and Monika Henzinger and Thatchaphol Saranurak for helpful information regarding prior work.  ... 
arXiv:2204.12721v3 fatcat:qe65bhaeordnjhrsl77v5fywoi

The Submodular Santa Claus Problem in the Restricted Assignment Case [article]

Etienne Bamas, Paritosh Garg, Lars Rohwedder
2020 arXiv   pre-print
,S_m is a partition of the resources. The result by Goemans et al. implies a polynomial time O(n^1/2 +ε)-approximation algorithm.  ...  The submodular Santa Claus problem was introduced in a seminal work by Goemans, Harvey, Iwata, and Mirrokni (SODA'09) as an application of their structural result.  ...  A tale of santa claus, hypergraphs and matroids. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 2748-2757, 2020.  ... 
arXiv:2011.06939v1 fatcat:qh4ysuy2ufcg3cwvqowiy6mkwa

Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing [article]

Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu
2021 arXiv   pre-print
Instance robustness insists on a smooth degradation in performance as a function of the change. Ideally, the performance is never worse than worst-case bounds.  ...  Instance robustness ensures that the prediction is robust to modest changes in the problem input, where the measure of the change may be problem specific.  ...  In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 1859- 1877.  ... 
arXiv:2011.11743v2 fatcat:tvt4v37f55hu7n6qwpik4ebvhq

LIPIcs, Volume 205, DNA 27, Complete Volume [article]

Matthew R. Lakin, Petr Šulc
2021
Acknowledgements We thank the four anonymous reviewers for their feedback on this paper and Noah Susag for his contributions to the Reactamole code.  ...  Acknowledgements We thank Trent Rogers, Niall Murphy, Pierre Marcus and Nicolas Schabanel for useful discussions on the Maze-Walking Tile Assembly Model.  ...  In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 2607-2624.  ... 
doi:10.4230/lipics.dna.27 fatcat:wtzel32jffg5xmuiomqjtevaha