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

Bruno Escoffier (1) , Jérôme Monnot (1) , Olivier Spanjaard (2)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
2 DECISION

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.

Domaines: Informatique [cs]

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. pp.280-291, ⟨10.1007/978-3-540-77566-9_24⟩. ⟨hal-01302947⟩