@InProceedings{megow_et_al:LIPIcs.APPROX/RANDOM.2020.37,
  author =	{Megow, Nicole and N\"{o}lke, Lukas},
  title =	{{Online Minimum Cost Matching with Recourse on the Line}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
  pages =	{37:1--37:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-164-1},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{176},
  editor =	{Byrka, Jaros{\l}aw and Meka, Raghu},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.37},
  URN =		{urn:nbn:de:0030-drops-126401},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2020.37},
  annote =	{Keywords: min-cost matching in bipartite graphs, recourse, competitive analysis, online}
}