Filters








17 Hits in 10.2 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

FPT Approximation for Constrained Metric k-Median/Means [article]

Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2020 arXiv   pre-print
In particular, we obtain a (3+ε)-approximation and (9+ε)-approximation for the constrained versions of the k-median and k-means problem respectively in FPT time.  ...  In many practical settings of the k-median/means problem, one is allowed to open a facility at any client location, i.e., C ⊆ L.  ...  Acknowledgements The authors would like to thank Anup Bhattacharya for useful discussions.  ... 
arXiv:2007.11773v1 fatcat:josqnidnabaytcmgdf2wuav2rm

Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271)

Maria Chudnovsky, Daniel Paulusma, Oliver Schaudt, Michael Wagner
2019 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 19271 "Graph Colouring: from Structure to Algorithm", which was held from 30 June to 5 July 2019.  ...  It also contains a collection of open problems on graph colouring which were posed during the seminar.  ...  Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 1257-1271. SIAM, 2019. , S. Huang, P.  ... 
doi:10.4230/dagrep.9.6.125 dblp:journals/dagstuhl-reports/ChudnovskyPS19 fatcat:5yv3kx3gufgwrpzbm6xu442vem

Generalized Stochastic Matching [article]

Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi
2022 arXiv   pre-print
We will discuss the first algorithms and analysis for this generalization of the Stochastic Matching model and prove that they achieve good approximation ratios.  ...  In particular, we show that the approximation factor of a natural algorithm for this problem is at least 0.6568 in unweighted graphs, and 1/2 + ϵ in weighted graphs for some constant ϵ > 0.  ...  Acknowledgements This research was supported by the NSF BIGDATA Grant No. 1546108, NSF SPX Grant No. 1822738, NSF AF Grant No. 2114269, and an Amazon AWS award.  ... 
arXiv:2205.14717v1 fatcat:rnyceccsezeonjljtuknadcc4q

Sketching Transformed Matrices with Applications to Natural Language Processing [article]

Yingyu Liang, Zhao Song, Mengdi Wang, Lin F. Yang, Xin Yang
2020 arXiv   pre-print
In this paper, we first propose a space-efficient sketching algorithm for computing the product of a given small matrix with the transformed matrix.  ...  We complement our theoretical results with experiments on synthetic and real data.  ...  In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 1825- 1843, 2019.  ... 
arXiv:2002.09812v1 fatcat:gcwy7iysnbhafhu4mcxydmk3hm

Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers [article]

Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford
2021 arXiv   pre-print
Our algorithm implies a O(m^3/2-1/58log U) time maxflow algorithm, improving over the O(m^3/2-1/328log U) time maxflow algorithm of [Gao-Liu-Peng FOCS 2021].  ...  A procedure for turning algorithms for estimating a sequence of vectors under updates from an oblivious adversary to one that tolerates adaptive adversaries via the Gaussian-mechanism from differential  ...  In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algo- rithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 2616–2635. SIAM, 2019.  ... 
arXiv:2112.00722v1 fatcat:v5fv24yzpbdrzlkeso4ofz5haq

Static pricing for multi-unit prophet inequalities [article]

Shuchi Chawla, Nikhil Devanur, Thodoris Lykouris
2021 arXiv   pre-print
On the other end of the spectrum, as k goes to infinity, the asymptotic performance of both static and adaptive pricing is well understood.  ...  Astonishingly, for k<20, it even outperforms the state-of-the-art adaptive pricing for the small-k regime.  ...  In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 1962–1981.  ... 
arXiv:2007.07990v2 fatcat:ka37h7wrjjhktjshkfdse5regy

A Tight Deterministic Algorithm for the Submodular Multiple Knapsack Problem [article]

Xiaoming Sun, Jialin Zhang, Zhijie Zhang
2021 arXiv   pre-print
Plenty of well-performing approximation algorithms have been designed for the maximization of (monotone or non-monotone) submodular functions over a variety of constraints.  ...  (ESA20) presented a tight (1-1/e-ϵ)-approximation randomized algorithm for SMKP. Their algorithm is based on the continuous greedy technique which inherently involves randomness.  ...  In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 241-254, 2019.  ... 
arXiv:2003.11450v4 fatcat:i55r5ozy2zfurlln5hotamsltm

Counting Independent Sets and Colorings on Random Regular Bipartite Graphs

Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao, Michael Wagner
2019 International Workshop on Approximation Algorithms for Combinatorial Optimization  
Our technique is based on the recent work of Jenssen, Keevash and Perkins (SODA, 2019) and we also apply it to confirm an open question raised there: For all q ≥ 3 and sufficiently large integers ∆ = ∆  ...  (q), there is an FPTAS to count the number of q-colorings on almost every ∆-regular bipartite graph.  ...  In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 2216-2234, 2019.  ... 
doi:10.4230/lipics.approx-random.2019.34 dblp:conf/approx/LiaoLLM19 fatcat:ip6tpov4sjbb3a5k54pxpvzlbm

Fully Dynamic Algorithm for Constrained Submodular Optimization [article]

Silvio Lattanzi, Slobodan Mitrović, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam
2020 arXiv   pre-print
We complement our theoretical analysis with an empirical study of the performance of our algorithm.  ...  The task of maximizing a monotone submodular function under a cardinality constraint is at the core of many machine learning and data mining applications, including data summarization, sparse regression  ...  In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 255-273, 2019.  ... 
arXiv:2006.04704v1 fatcat:enk7gqxxafg57jguhapc2svnxu

Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for ε-Product Spaces [article]

Tom Gur, Noam Lifshitz, Siqi Liu
2021 arXiv   pre-print
As in the settings of the p-biased hypercube, the symmetric group, and the Grassmann scheme, our inequalities are effective for global functions, which are functions that are not significantly affected  ...  by a restriction of a small set of coordinates.  ...  In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 2134–2153, 2019. [14] Irit Dinur and Tali Kaufman.  ... 
arXiv:2111.09375v4 fatcat:pd4s5ihsqjcdvox5sikcrqmaoy

Outlier-robust estimation of a sparse linear model using ℓ_1-penalized Huber's M-estimator [article]

Arnak S. Dalalyan, Philip Thompson
2019 arXiv   pre-print
In the case where the labels are contaminated by at most o adversarial outliers, we prove that the ℓ_1-penalized Huber's M-estimator based on n samples attains the optimal rate of convergence (s/n)^1/2  ...  For more general design matrices, our results highlight the importance of two properties: the transfer principle and the incoherence property.  ...  In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 2745-2754. Donoho, D. and Montanari, A. (2016).  ... 
arXiv:1904.06288v3 fatcat:hzcdyndk5veazddfiikllri7du

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

Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users [article]

Moni Naor, Neil Vexler
2020 arXiv   pre-print
We also present the concept of Mechanism Chaining, using the output of one mechanism as the input of another, in the scope of Differential Privacy, and show that the chaining of an ε_1-LDP mechanism with  ...  ACM CCS, 2014) is trackable in our framework for the parameters presented in their paper.  ...  Part of this work was done while the second author was visiting the Simons Institute as part of the Data Privacy: Foundations and Applications program.  ... 
arXiv:2004.03002v1 fatcat:rf4rfml5ebcbhlfluk2l7qc2we

Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers [article]

Arun Jambulapati, Aaron Sidford
2020 arXiv   pre-print
In this paper we provide an O(m (loglog n)^O(1)log(1/ϵ))-expected time algorithm for solving Laplacian systems on n-node m-edge graphs, improving improving upon the previous best expected runtime of O(  ...  For small k, this improves upon the previous best known multiplicative factor of k ·Õ(log d), which is only known for the graph case.  ...  We thank anonymous reviewers for feedback on earlier versions of this paper.  ... 
arXiv:2011.08806v1 fatcat:xswiqovfgjc3ddrgmpfq6npdpa
« Previous Showing results 1 — 15 out of 17 results