Publisher
Springer International Publishing
Reference34 articles.
1. Ageev, A.A.: A criterion of polynomial-time solvability for the network location problem. In: Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992, pp. 237–245 (1992)
2. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM 51(3), 363–384 (2004)
3. Alber, J., Fernau, H., Niedermeier, R.: Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1), 26–56 (2004)
4. Berman, O., Drezner, Z., Krass, D.: Generalized coverage: new developments in covering location models. Comput. Oper. Res 37(10), 1675–1687 (2010)
5. Berman, O., Drezner, Z., Wesolowsky, G.O.: The maximal covering problem with some negative weights. Geograph. Anal. 41(1), 30–42 (2009)