A short note on the approximability of the maximum leaves spanning tree problem

Cites Work

Title not available (Why is that?)
Approximation algorithms for combinatorial problems
Optimization, approximation, and complexity classes
Self-stabilizing systems in spite of distributed control
Title not available (Why is that?)
Completeness in approximation classes
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (30)

The approximability of the weighted Hamiltonian path completion problem on a tree
Minimal spanning trees with a constraint on the number of leaves
On the approximability of some maximum spanning tree problems
Complexity of the maximum leaf spanning tree problem on planar and regular graphs
A new algorithm for finding trees with many leaves
The connected domination number of grids
Leafy spanning trees in hypercubes
Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
Max-leaves spanning tree is APX-hard for cubic graphs
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
Title not available (Why is that?)
Approximating the Maximally Balanced Connected Partition Problem in graphs
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
On the approximability of some Maximum Spanning Tree Problems
Memory-efficient enumeration of constrained spanning trees
Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
Traceability of connected domination critical graphs
A Simple 2-Approximation for Maximum-Leaf Spanning Tree
Spanning trees with a constraint on the number of leaves. A new formulation
Leafy spanning \(k\)-forests
Approximation hardness of dominating set problems in bounded degree graphs
Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
Connected domination of regular graphs
Reformulations and solution algorithms for the maximum leaf spanning tree problem
On Finding Directed Trees with Many Leaves
The generalized definitions of the two-dimensional largest common substructure problems
An exact algorithm for the maximum leaf spanning tree problem.
Spanning Trees with Many Leaves in Regular Bipartite Graphs
On maximum leaf trees and connections to connected maximum cut problems
A 2-approximation algorithm for finding a spanning tree with maximum number of leaves

This page was built for publication: A short note on the approximability of the maximum leaves spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336751)