The Power of Recourse for Online MST and TSP

@article{Megow2016ThePO,
  title={The Power of Recourse for Online MST and TSP},
  author={Nicole Megow and Martin Skutella and Jos{\'e} Verschae and Andreas Wiese},
  journal={SIAM J. Comput.},
  year={2016},
  volume={45},
  pages={859-880}
}
We consider the online MST and TSP problems with recourse. The nodes of an unknown graph with metric edge cost appear one by one and must be connected in such a way that the resulting tree or tour has low cost. In the standard online setting, with irrevocable decisions, no algorithm can guarantee a constant competitive ratio. In our model we allow recourse actions by giving a limited budget of edge rearrangements per iteration. It has been an open question for more than 20 years if an online… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 16 references

The Power of Recourse in Online Optimization

  • J. Verschae
  • PhD thesis, Technische Universität Berlin…
  • 2012
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…