Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Latest Publications

TOTAL DOCUMENTS

182

(FIVE YEARS 182)

H-INDEX

3

(FIVE YEARS 3)

Published By Society For Industrial And Applied Mathematics

9781611975994

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.51 ◽

2020 ◽

pp. 837-853

Author(s):

Brian Axelrod ◽

Yang P. Liu ◽

Aaron Sidford

Keyword(s):

Submodular Function ◽

Function Minimization ◽

Submodular Function Minimization

Download Full-text

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.107 ◽

2020 ◽

pp. 1753-1772

Author(s):

Michael Kapralov ◽

Slobodan Mitrović ◽

Ashkan Norouzi-Fard ◽

Jakab Tardos

Keyword(s):

Maximum Matching ◽

Efficient Approximation

Download Full-text

Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.170 ◽

2020 ◽

pp. 2790-2809

Author(s):

Sungjin Im ◽

Maryam Shadloo

Keyword(s):

Completion Time ◽

Contention Resolution ◽

Unrelated Machines ◽

Time Minimization ◽

Weighted Completion Time

Download Full-text

Competitive Analysis with a Sample and the Secretary Problem

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.128 ◽

2020 ◽

pp. 2082-2095 ◽

Author(s):

Haim Kaplan ◽

David Naori ◽

Danny Raz

Keyword(s):

Competitive Analysis ◽

Secretary Problem

Download Full-text

Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.163 ◽

2020 ◽

pp. 2673-2687 ◽

Author(s):

Jugal Garg ◽

Pooja Kulkarni ◽

Rucha Kulkarni

Keyword(s):

Download Full-text

Individual Sensitivity Preprocessing for Data Privacy

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.32 ◽

2020 ◽

pp. 528-547

Author(s):

Rachel Cummings ◽

David Durfee

Keyword(s):

Data Privacy ◽

Individual Sensitivity

Download Full-text

On the Tractability of Public Persuasion with No Externalities

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.165 ◽

2020 ◽

pp. 2708-2727

Author(s):

Haifeng Xu

Download Full-text

Quantifying the Burden of Exploration and the Unfairness of Free Riding

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.116 ◽

2020 ◽

pp. 1892-1904

Author(s):

Christopher Jung ◽

Sampath Kannan ◽

Neil Lutz

Keyword(s):

Download Full-text

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.28 ◽

2020 ◽

pp. 463-475

Author(s):

Shiri Chechik ◽

Tianyi Zhang

Keyword(s):

Download Full-text

Tightening Curves on Surfaces Monotonically with Applications

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.46 ◽

2020 ◽

pp. 747-766

Author(s):

Hsien-Chih Chang ◽

Arnaud de Mesmay

Keyword(s):

Curves On Surfaces

Download Full-text