Speaker - Jannik Matuschke

Maintaining Perfect Matchings at Low Cost Fri, May 10, 2019 12:30 CEST

Speakers: Jannik Matuschke

The min-cost matching problem suffers from being very sensitive to small changes of the input. Even in a simple setting, e.g., when the costs come from the metric on the line, adding two nodes to the input might change the optimal solution completely. On the other hand, one expects that small changes in the input should incur only small changes on the constructed solutions, measured as the number of modified edges.