Some tractable instances of interval data minmax regret problems: bounded distance from triviality (short version)

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 well known solvable 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01302947
Contributor : Lip6 Publications <>
Submitted on : Monday, July 10, 2017 - 6:01:11 PM
Last modification on : Thursday, March 21, 2019 - 2:19:28 PM
Document(s) archivé(s) le : Wednesday, January 24, 2018 - 6:27:15 PM

File

pub_1026_1_SOFSEM08.pdf
Files produced by the author(s)

Identifiers

Citation

Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard. Some tractable instances of interval data minmax regret problems: bounded distance from triviality (short version). 34th International Conference on Current Trends in Theory and Practice of Computer Science, Jan 2008, Nový Smokovec, Slovakia. Springer-Verlag, 34th International Conference on Current Trends in Theory and Practice of Computer Science, 4910, pp.280-291, Lecture Notes in Computer Science. 〈10.1007/978-3-540-77566-9_24〉. 〈hal-01302947〉

Share

Metrics

Record views

195

Files downloads

28