Min-Cost Bipartite Perfect Matching with Delays

Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul M. Makhijani, Yuyi Wang, Roger Wattenhofer. Min-Cost Bipartite Perfect Matching with Delays. In Klaus Jansen, José D. P. Rolim, David Williamson, Santosh Srinivas Vempala, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA. Volume 81 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

@inproceedings{AshlagiACCGKMWW17,
  title = {Min-Cost Bipartite Perfect Matching with Delays},
  author = {Itai Ashlagi and Yossi Azar and Moses Charikar and Ashish Chiplunkar and Ofir Geri and Haim Kaplan and Rahul M. Makhijani and Yuyi Wang and Roger Wattenhofer},
  year = {2017},
  doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.1},
  url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.1},
  researchr = {https://researchr.org/publication/AshlagiACCGKMWW17},
  cites = {0},
  citedby = {0},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA},
  editor = {Klaus Jansen and José D. P. Rolim and David Williamson and Santosh Srinivas Vempala},
  volume = {81},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-044-6},
}