Some tractable instances of interval data minmax regret problems: bounded distance from triviality

Abstract : This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particular instances of the interval data minmax regret versions of the shortest path, minimum spanning tree and weighted (bipartite) perfect matching problems. These sets are defined using a parameter that measures the distance from trivial instances. Tractable cases occur when the parameter is bounded by a constant. Two kinds of parameters are investigated, measuring either the distance from special weight structures or the distance from special graph structures.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00179399
Contributor : Marie-Hélène Hugonnard-Roche <>
Submitted on : Monday, October 15, 2007 - 2:29:21 PM
Last modification on : Thursday, March 21, 2019 - 1:07:06 PM
Long-term archiving on : Sunday, April 11, 2010 - 11:02:23 PM

File

cahierLamsade265.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00179399, version 1

Citation

Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard. Some tractable instances of interval data minmax regret problems: bounded distance from triviality. 2007. ⟨hal-00179399⟩

Share

Metrics

Record views

415

Files downloads

194