The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...