Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
From MaRDI portal
Publication:5448654
DOI10.1007/978-3-540-77566-9_24zbMath1132.68505OpenAlexW1578867221MaRDI QIDQ5448654
Olivier Spanjaard, Bruno Escoffier, Jérôme Monnot
Publication date: 7 March 2008
Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_24
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Algorithms for the minmax regret path problem with interval data ⋮ Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality ⋮ Some tractable instances of interval data minmax regret problems
Cites Work
- Unnamed Item
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Non deterministic polynomial optimization problems and their approximations
- Robust discrete optimization and its applications
- On the complexity of the robust spanning tree problem with interval data
- Interval data minmax regret network optimization problems
- On digraph coloring problems and treewidth duality
- Nonserial dynamic programming
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- The Recognition of Series Parallel Digraphs
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- Parameterized and Exact Computation
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
This page was built for publication: Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
