Incremental algorithms for the maximum internal spanning tree problem
Open Access
- 6 April 2021
- journal article
- research article
- Published by Springer Nature in Science China Information Sciences
- Vol. 64 (5) , 1-8
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover2014
- Better Approximation Algorithms for the Maximum Internal Spanning Tree ProblemAlgorithmica, 2013
- A linear vertex kernel for maximum internal spanning treeJournal of Computer and System Sciences, 2013
- A General Approach for Incremental Approximation and Hierarchical ClusteringSIAM Journal on Computing, 2010
- On finding spanning trees with few leavesInformation Processing Letters, 2008
- Approximation algorithms for a hierarchically structured bin packing problemInformation Processing Letters, 2004
- Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms — the Case of k-Internal Spanning Tree2003
- The Online Median ProblemSIAM Journal on Computing, 2003
- Parameterized ComplexityThe Bulletin of Symbolic Logic, 2002
- The minimum latency problem1994