Complexity of the directed spanning cactus problem

Authors:
Anna Palbom
Affiliations:
KTH - Numerical Analysis and Computer Science, SE-100 44 Stockholm, Sweden
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 6
Cited 1

Introduction to algorithms

Introduction to algorithms
Remarks on Hamiltonian properties of powers of digraphs

2nd Twente workshop on Graphs and combinatorial optimization
P-Complete Approximation Problems

Journal of the ACM (JACM)
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science

Spanning cactus of a graph: Existence, extension, optimization, and approximation

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper we study the complexity of finding a spanning cactus in various graphs. First, we show that the task of determining if there is a directed spanning cactus in a general unweighted digraph is NP-complete. The proof is a reduction from ONE-IN-THREE 3SAT. Secondly, we show that finding the minimum spanning cactus in a directed, weighted complete graph with triangle inequality is polynomial time equivalent to finding the minimum travelling salesman problem (TSP) tour in the same graph and that they have the same hardness in approximation.