Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference13 articles.
1. Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M (2012) Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer Science & Business Media, Berlin
2. Chellali M, Haynes TW, Hedetniemi ST, McRae AA (2016) Roman 2-domination. Discret Appl Math 204:22–28
3. Guibas LJ, Hershberger JE, Mitchell JS, Snoeyink JS (1993) Approximating polygons and subdivisions with minimum-link paths. Int J Comput Geom Appl 3(04):383–415
4. Henning MA, Klostermeyer WF (2017) Italian domination in trees. Discret Appl Math 217:557–564
5. Johnson DS, Stockmeyer L (1976) Some simplified NP-complete graph problems. Theoret Comput Sci 1:237–267