Optimal reduction of two-terminal directed acyclic graphs
SIAM Journal on Computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Nonserial Dynamic Programming
Interval data minmax regret network optimization problems
Discrete Applied Mathematics
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
An approximation algorithm for interval data minmax regret combinatorial optimization problems
Information Processing Letters
The robust shortest path problem in series-parallel multidigraphs with interval data
Operations Research Letters
On the complexity of the robust spanning tree problem with interval data
Operations Research Letters
Parameterized Complexity
Some tractable instances of interval data minmax regret problems
Operations Research Letters
| Hi-index | 0.00 |
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.