A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
- 11 October 2022
- journal article
- research article
- Published by Springer Nature in Optimization Letters
- Vol. 17 (6) , 1435-1454
Abstract
No abstract availableKeywords
Funding Information
- Secretaría de Ciencia, Humanidades, Tecnología e Innovación (304006)
This publication has 35 references indexed in Scilit:
- A self-stabilizing algorithm to maximal 2-packing with improved complexityInformation Processing Letters, 2012
- Efficient transformation of distance-2 self-stabilizing algorithmsJournal of Parallel and Distributed Computing, 2012
- Distance- k knowledge in self-stabilizing algorithmsTheoretical Computer Science, 2008
- NP-hard graph problems and boundary classes of graphsTheoretical Computer Science, 2007
- DISTANCE-TWO INFORMATION IN SELF-STABILIZING ALGORITHMSParallel Processing Letters, 2004
- Roman domination in graphsDiscrete Mathematics, 2004
- Independent sets with domination constraintsDiscrete Applied Mathematics, 2000
- Packing schemes for gang scheduling1996
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Efficient Planarity TestingJournal of the ACM, 1974