scientific article
From MaRDI portal
Publication:2861557
zbMath1274.05454MaRDI QIDQ2861557
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S157106531000154X
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Trees (05C05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (6)
Scatter search for the minimum leaf spanning tree problem ⋮ Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} ⋮ Representative families: a unified tradeoff-based approach ⋮ Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs ⋮ Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree ⋮ Better approximation algorithms for the maximum internal spanning tree problem
Cites Work
- Approximating the maximum internal spanning tree problem
- On a conjecture of Las Vergnas concerning certain spanning trees in graphs
- On finding spanning trees with few leaves
- Neighborhood unions and extremal spanning trees
- Spanning trees with few leaves
- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
- Approximation Algorithms for the Maximum Internal Spanning Tree Problem
- Algorithms and Data Structures
This page was built for publication:
