On the approximability of the minimum strictly fundamental cycle basis problem

  title={On the approximability of the minimum strictly fundamental cycle basis problem},
  author={G. Galbiati and R. Rizzi and E. Amaldi},
  journal={Discret. Appl. Math.},
We consider the problem of finding a strictly fundamental cycle basis of minimum weight in the cycle space associated with an undirected connected graph G , where a nonnegative weight is assigned to each edge of G and the total weight of a basis is defined as the sum of the weights of all the cycles in the basis. Several heuristics have been proposed to tackle this NP-hard problem, which has some interesting applications. In this paper we show that this problem is APX-hard, even when restricted… Expand
Minimum cut bases in undirected networks
Edge-swapping algorithms for the minimum fundamental cycle basis problem
Minimum strictly fundamental cycle bases of planar graphs are hard to find
Cycle bases in graphs characterization, algorithms, complexity, and applications
Approximation Algorithms for Conflict-Free Vehicle Routing
On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees
On minimum average stretch spanning trees in polygonal 2-trees


On the Approximability of the Minimum Fundamental Cycle Basis Problem
On Min-Max Cycle Bases
Algorithms for Generating Fundamental Cycles in a Graph
A polynomial time approximation scheme for minimum routing cost spanning trees
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
  • J. Horton
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1987
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases
Classes of cycle bases
Minimum Weakly Fundamental Cycle Bases Are Hard To Find
  • R. Rizzi
  • Computer Science, Mathematics
  • Algorithmica
  • 2007
Some APX-completeness results for cubic graphs
Hardness of Approximating Problems on Cubic Graphs