A moderately exponential time algorithm for full degree spanning tree

Authors:
Serge Gaspers;Saket Saurabh;Alexey A. Stepanov
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Year:
2008

Citing 10
Cited 3

On Local Search and Placement of Meters in Networks

SIAM Journal on Computing
Measure and conquer: a simple O(20.288n) independent set algorithm

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Inclusion--Exclusion Algorithms for Counting Set Partitions

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Solving connected dominating set faster than 2n

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Exact computation of maximum induced forest

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Measure and conquer: domination – a case study

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Finding a minimum feedback vertex set in time O(1.7548n)

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Fixed-parameter tractability results for full-degree spanning tree and its dual

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation

Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Sharp separation and applications to exact and parameterized algorithms

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the directed Full Degree Spanning Tree problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the well studied FULL DEGREE SPANNING TREE problem, a NP-complete variant of the SPANNING TREE problem, in the realm of moderately exponential time exact algorithms. In this problem, given a graph G, the objective is to find a spanning tree T of G which maximizes the number of vertices that have the same degree in T as in G. This problem is motivated by its application in fluid networks and is basically a graph-theoretic abstraction of the problem of placing flow meters in fluid networks. We give an exact algorithm for FULL DEGREE SPANNING TREE running in time O(1.9172n). This adds FULL DEGREE SPANNING TREE to a very small list of "non-local problems", likeFEEDBACK VERTEX SET and CONNECTED DOMINATING SET, for which non-trivial (non brute force enumeration) exact algorithms are known.