A short note on the approximability of the maximum leaves spanning tree problem
From MaRDI portal
(Redirected from Publication:1336751)
Cites work
- scientific article; zbMATH DE number 3742629 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256635 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- Approximation algorithms for combinatorial problems
- Completeness in approximation classes
- Optimization, approximation, and complexity classes
- Self-stabilizing systems in spite of distributed control
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
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- A new algorithm for finding trees with many leaves
- On the approximability of some maximum spanning tree problems
- The connected domination number of grids
- Max-leaves spanning tree is APX-hard for cubic graphs
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- Leafy spanning trees in hypercubes
- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
- scientific article; zbMATH DE number 2230227 (Why is no real title available?)
- 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
- On finding directed trees with many leaves
- Memory-efficient enumeration of constrained spanning trees
- Traceability of connected domination critical graphs
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
- Spanning trees with a constraint on the number of leaves. A new formulation
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree
- Leafy spanning \(k\)-forests
- Approximation hardness of dominating set problems in bounded degree graphs
- Connected domination of regular graphs
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
- The generalized definitions of the two-dimensional largest common substructure problems
- An exact algorithm for the maximum leaf spanning tree problem.
- On maximum leaf trees and connections to connected maximum cut problems
- Spanning Trees with Many Leaves in Regular Bipartite Graphs
- 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)
