Author:
Roayaei Mehdy,Razzazi Mohammadreza
Funder
Institute for Research in Fundamental Sciences (IPM)
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference51 articles.
1. Alber J, Bodlaender HL, Fernau H, Kloks T, Niedermeier R (2002) Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33:461–493
2. Bilò D, Gualà L, Proietti G (2012) Improved approximability and non-approximability results for graph diameter decreasing problems. Theor Comput Sci 417:12–22
3. Charikar M, Chekuri C, Cheung T et al (1998) Approximation algorithms for directed Steiner problems. In: Proceedings of the ninth annual ACM-SIAM symposium on discrete algorithms, pp 192–200
4. Chen JE (2005) Parameterized computation and complexity: a new approach dealing with NP-hardness. J Comput Sci Technol 20(1):18–37
5. Chen JE, Feng QL (2014) On unknown small subsets and implicit measures: new techniques for parameterized algorithms. J Comput Sci Technol 29(5):870–878