Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Quanquan C. Liu, Yiduo Ke, and Samir Khuller. Scalable Auction Algorithms for Bipartite Maximum Matching Problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 28:1-28:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{liu_et_al:LIPIcs.APPROX/RANDOM.2023.28, author = {Liu, Quanquan C. and Ke, Yiduo and Khuller, Samir}, title = {{Scalable Auction Algorithms for Bipartite Maximum Matching Problems}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {28:1--28:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-296-9}, ISSN = {1868-8969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.28}, URN = {urn:nbn:de:0030-drops-188537}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.28}, annote = {Keywords: auction algorithms, maximum weight bipartite matching, maximum b-matching, distributed blackboard model, parallel work-depth model, streaming model, massively parallel computation model} }
Published in: LIPIcs, Volume 256, 4th Symposium on Foundations of Responsible Computing (FORC 2023)
Arpita Biswas, Yiduo Ke, Samir Khuller, and Quanquan C. Liu. An Algorithmic Approach to Address Course Enrollment Challenges. In 4th Symposium on Foundations of Responsible Computing (FORC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 256, pp. 8:1-8:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{biswas_et_al:LIPIcs.FORC.2023.8, author = {Biswas, Arpita and Ke, Yiduo and Khuller, Samir and Liu, Quanquan C.}, title = {{An Algorithmic Approach to Address Course Enrollment Challenges}}, booktitle = {4th Symposium on Foundations of Responsible Computing (FORC 2023)}, pages = {8:1--8:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-272-3}, ISSN = {1868-8969}, year = {2023}, volume = {256}, editor = {Talwar, Kunal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2023.8}, URN = {urn:nbn:de:0030-drops-179297}, doi = {10.4230/LIPIcs.FORC.2023.8}, annote = {Keywords: fairness, allocation, matching, algorithms} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, and Kanak Mahadik. Correlated Stochastic Knapsack with a Submodular Objective. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 91:1-91:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{yang_et_al:LIPIcs.ESA.2022.91, author = {Yang, Sheng and Khuller, Samir and Choudhary, Sunav and Mitra, Subrata and Mahadik, Kanak}, title = {{Correlated Stochastic Knapsack with a Submodular Objective}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {91:1--91:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.91}, URN = {urn:nbn:de:0030-drops-170296}, doi = {10.4230/LIPIcs.ESA.2022.91}, annote = {Keywords: Stochastic Knapsack, Submodular Optimization, Stochastic Optimization} }
Published in: LIPIcs, Volume 146, 33rd International Symposium on Distributed Computing (DISC 2019)
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, and Gregory Schwartzman. Optimal Distributed Covering Algorithms. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 5:1-5:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{benbasat_et_al:LIPIcs.DISC.2019.5, author = {Ben-Basat, Ran and Even, Guy and Kawarabayashi, Ken-ichi and Schwartzman, Gregory}, title = {{Optimal Distributed Covering Algorithms}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {5:1--5:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.5}, URN = {urn:nbn:de:0030-drops-113129}, doi = {10.4230/LIPIcs.DISC.2019.5}, annote = {Keywords: Distributed Algorithms, Approximation Algorithms, Vertex Cover, Set Cover} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Ioana O. Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, and Melanie Schmidt. On the Cost of Essentially Fair Clusterings. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 18:1-18:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bercea_et_al:LIPIcs.APPROX-RANDOM.2019.18, author = {Bercea, Ioana O. and Gro{\ss}, Martin and Khuller, Samir and Kumar, Aounon and R\"{o}sner, Clemens and Schmidt, Daniel R. and Schmidt, Melanie}, title = {{On the Cost of Essentially Fair Clusterings}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {18:1--18:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.18}, URN = {urn:nbn:de:0030-drops-112337}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.18}, annote = {Keywords: approximation, clustering, fairness, LP rounding} }
Published in: LIPIcs, Volume 122, 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)
Sapna Grover, Neelima Gupta, Samir Khuller, and Aditya Pancholi. Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 122, pp. 23:1-23:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{grover_et_al:LIPIcs.FSTTCS.2018.23, author = {Grover, Sapna and Gupta, Neelima and Khuller, Samir and Pancholi, Aditya}, title = {{Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem}}, booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)}, pages = {23:1--23:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-093-4}, ISSN = {1868-8969}, year = {2018}, volume = {122}, editor = {Ganguly, Sumit and Pandya, Paritosh}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.23}, URN = {urn:nbn:de:0030-drops-99224}, doi = {10.4230/LIPIcs.FSTTCS.2018.23}, annote = {Keywords: Capacitated Knapsack Median, Capacitated k -Facility Location} }
Published in: LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
Samir Khuller and Sheng Yang. Revisiting Connected Dominating Sets: An Optimal Local Algorithm?. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 11:1-11:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{khuller_et_al:LIPIcs.APPROX-RANDOM.2016.11, author = {Khuller, Samir and Yang, Sheng}, title = {{Revisiting Connected Dominating Sets: An Optimal Local Algorithm?}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)}, pages = {11:1--11:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-018-7}, ISSN = {1868-8969}, year = {2016}, volume = {60}, editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.11}, URN = {urn:nbn:de:0030-drops-66340}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.11}, annote = {Keywords: graph algorithms, approximation algorithms, dominating sets, local information algorithms} }
Published in: LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016)
Riley Murray, Megan Chao, and Samir Khuller. Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 68:1-68:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{murray_et_al:LIPIcs.ESA.2016.68, author = {Murray, Riley and Chao, Megan and Khuller, Samir}, title = {{Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {68:1--68:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.68}, URN = {urn:nbn:de:0030-drops-64104}, doi = {10.4230/LIPIcs.ESA.2016.68}, annote = {Keywords: approximation algorithms, distributed computing, machine scheduling, LP relaxations, primal-dual algorithms} }
Published in: LIPIcs, Volume 45, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Hal Daumé III, Samir Khuller, Manish Purohit, and Gregory Sanders. On Correcting Inputs: Inverse Optimization for Online Structured Prediction. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 38-51, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{daumeiii_et_al:LIPIcs.FSTTCS.2015.38, author = {Daum\'{e} III, Hal and Khuller, Samir and Purohit, Manish and Sanders, Gregory}, title = {{On Correcting Inputs: Inverse Optimization for Online Structured Prediction}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {38--51}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.38}, URN = {urn:nbn:de:0030-drops-56375}, doi = {10.4230/LIPIcs.FSTTCS.2015.38}, annote = {Keywords: Inverse Optimization, Structured Prediction, Online Learning} }
Published in: Dagstuhl Seminar Proceedings, Volume 10071, Scheduling (2010)
Samir Khuller, Jian Li, and Barna Saha. Energy Efficient Scheduling via Partial Shutdown. In Scheduling. Dagstuhl Seminar Proceedings, Volume 10071, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{khuller_et_al:DagSemProc.10071.5, author = {Khuller, Samir and Li, Jian and Saha, Barna}, title = {{Energy Efficient Scheduling via Partial Shutdown}}, booktitle = {Scheduling}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10071}, editor = {Susanne Albers and Sanjoy K. Baruah and Rolf H. M\"{o}hring and Kirk Pruhs}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10071.5}, URN = {urn:nbn:de:0030-drops-25435}, doi = {10.4230/DagSemProc.10071.5}, annote = {Keywords: Unrelated parallel machine scheduling, approximation algorithms} }
Feedback for Dagstuhl Publishing