Graphs and algorithms
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
An approximation algorithm for interval data minmax regret combinatorial optimization problems
Information Processing Letters
Some tractable instances of interval data minmax regret problems: bounded distance from triviality
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
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
| Hi-index | 0.00 |
In this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes 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.