Matsui, T., "Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs", in JCDCG, LnCS 1763, Springer-Verlag, Berlin, 1998, pp.Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J., "Simple Heuristics for Unit Disk Graphs", networks 25 (1995), pp.Hunt III, D.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E., "nC-Approximation Schemes for nP- and PSPACE-Hard Problems for Geometric Graphs", J.Hochbaum, D.S., Maass, W., "Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI", JACM 32 1 (1985), pp.Erlebach, T., Jansen, K., Seidel, E., "Polynomial-time Approximation Schemes for Geometric Graphs" in SODA 2001, SIAM, 2001, pp.Downey, R.G., Fellows, M.R., Parameterized Complexity, Springer-Verlag, new York, 1999.Demaine, E.D., Hajiaghayi, M., "Bidimensionality: new Connections between FPT Algorithms and PTASs" in SODA 2005, SIAM, 2005, pp.Clark, B.n., Colbourn, C.J., Johnson, D.S., "Unit Disk Graphs", Discr.Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z., "A Polynomial-Time Approximation Scheme for the Minimum Connected Dominating Set in Ad Hoc Wireless networks", networks 42 4 (Dec.Chan, T.M., "Polynomial-time Approximation Schemes for Packing and Piercing Fat Objects", J.Bodlaender, H.L., "A Tourist Guide through Treewidth", Acta Cybernetica 11 1-2 (1993), pp. Baker, B.S., "Approximation Algorithms for nP-Complete Problems on Planar Graphs", JACM 41 1 (1994), pp.Ausiello, G., Creszenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M., Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability, Springer-Verlag, Berlin, 1999.Alber, J., niedermeier, R., "Improved Tree Decomposition Based Algorithms for Domination-like Problems" in LATIn 2002, LnCS 2286, Springer-Verlag, Berlin, 2002, pp.Alber, J., Fiala, J., "Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs", J.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |