On connected dominating sets of restricted diameter
Authors:
- Austin BuchananABAustin Buchanan
- Je Sang SungJSJe Sang Sung
- Vladimir BoginskiVBVladimir Boginski
- Sergiy ButenkoSBSergiy Butenko
- 1 July 2014
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 236 (2) , 410-418
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- An exact algorithm for the Maximum Leaf Spanning Tree problemTheoretical Computer Science, 2011
- Solving Connected Dominating Set Faster than 2 nAlgorithmica, 2007
- Algorithmic construction of sets for k -restrictionsACM Transactions on Algorithms, 2006
- Polynomial-time data reduction for dominating setJournal of the ACM, 2004
- The maximum‐leaf spanning tree problem: Formulations and facetsNetworks, 2004
- An exact algorithm for the maximum leaf spanning tree problemComputers & Operations Research, 2003
- A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networksNetworks, 2003
- An exact algorithm for the maximum k-club problem in an undirected graphEuropean Journal of Operational Research, 2002
- Approximating Maximum Leaf Spanning Trees in Almost Linear TimeJournal of Algorithms, 1998
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsJournal of Algorithms, 1998