Publisher
Springer Nature Switzerland
Reference18 articles.
1. Hassene Aissi, Cristina Bazgan, and Daniel Vanderpooten. “Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack”. In: Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings 13. Springer. 2005, pp. 862–873.
2. Igor Averbakh and Vasilij Lebedev. “Interval data min-max regret network optimization problems”. In: Discrete Applied Mathematics 138.3 (2004), pp. 289–301.
3. Ionuţ D. Aron and Pascal Van Hentenryck. “On the complexity of the robust spanning tree problem with interval data”. In: Operations Research Letters 32.1 (2004), pp. 36–40.
4. S. Bezrukov, Firoz Kaderali, and Werner Poguntke. “On central spanning trees of a graph”. In: Combinatorics and Computer Science: 8th Franco-Japanese and 4th Franco-Chinese Conference Brest, France, July 3–5, 1995 Selected Papers. Springer. 1996, pp. 53–57.
5. Francisco Barahona and William R. Pulleyblank. “Exact arborescences, matchings and cycles”. In: Discrete Applied Mathematics 16.2 (1987), pp. 91–99.