• Corpus ID: 115316482

Interval Spanning Trees Problem: Solvability and Computational Complexity

  title={Interval Spanning Trees Problem: Solvability and Computational Complexity},
  author={Galina Kozina and Vitaly A. Perepelitsa},
The optimization Spanning Trees Problem on graphs with interval weights is presented. The interval function is defined as the sum of interval weights of feasible spanning tree edges. The relation order introduced into set of feasible solutions generates the Pareto set which is considered as the solution of the interval problem. The questions of solvability and computational complexity are investigated by applying the multicriterial approach. 

Figures from this paper

On the complexity of the robust spanning tree problem with interval data
A Constraint Satisfaction Approach to the Robust Spanning Tree Problem with Interval Data
This paper considers the robust spanning tree problem with interval data and proposes a constraint satisfaction approach using a combinatorial lower bound, a pruning component that removes infeasible and suboptimal edges, as well as a search strategy exploring the most uncertain edges first.
The robust spanning tree problem with interval data
A Benders decomposition approach for the robust spanning tree problem with interval data
Interval-parameter optimization problems on graphs
Well-known optimization problems on graphs are considered under uncertainty when parameter domains are specified in the form of intervals, and sufficient conditions of statistical efficiency of a proposed approximate algorithm are constructively substantiated.
How informative are Minimum Spanning Tree algorithms?
This paper investigates noisy versions of the Minimum Spanning Tree (MST) problem and compares the generalization properties of MST algorithms and provides insights for algorithm design when noise in combinatorial optimization is unavoidable.
Simulated annealing algorithm for the robust spanning tree problem
This is the first attempt to develop a metaheuristic approach for solving the robust spanning tree problem with interval data, namely simulated annealing, in order to calculate an approximate solution for large scale instances efficiently.
A branch and bound algorithm for the robust spanning tree problem with interval data
Heuristics for the central tree problem
This paper addresses the central spanning tree problem with a hybrid heuristic consisting of: (1) a greedy construction heuristic to get a good initial solution and (2) fast local search improvement.
Constructor design problem under uncertain data
  • G. Kozina
  • Computer Science
    Experience of Designing and Applications of CAD Systems in Microelectronics. Proceedings of the VI-th International Conference. CADSM 2001 (IEEE Cat. No.01 EX473)
  • 2001
In this case, interval optimization problem with interval objective function is considered, which involves solving optimization problems on graphs on graphs under uncertainty.


Complexity of vector optimization problems on graphs
The unsolvability of a series of combinatorial multi-objective problems has been set up by means of linear convolution algorithm, and the sufficient conditions under which these algorithms are statistically efficient have been obtained.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
Introduction to Interval Computation
Methods of Interval Analysis
Three types of errors are encountered in numerical analysis, namely: 1. Round-off errors, arising when numbers are rounded to fit a certain precision arithmetic; e.g. the case where 1/6 =
Revised version: December 10
  • Revised version: December 10
  • 1993
Transport networks synthesis under incertainty conditions of initial information
  • Proceedings of Seminar on Interval Mathematics
  • 1990
Optimization under uncertainty conditions
  • Bulgaria)
  • 1989
On the problem of finding sets of alternatives in discrete multiobjective problems
  • Kibernetika
  • 1987
Introduction to interval computations
  • Introduction to interval computations
  • 1983
Graph Theory. An Algorithmic Approach