From few components to an Eulerian graph by adding arcs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6986 LNCS, Issue , 2011, Pages 307-318

  Sorge, Manuel ^a   Van Bevern, René ^a   Niedermeier, Rolf ^a   Weller, Mathias ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINED PARAMETER; CONNECTED COMPONENT; EULERIAN; EULERIAN GRAPHS; MULTIGRAPHS; NP-HARD; PARAMETER COMBINATION; PROBLEM KERNEL; TOTAL COSTS;

COMPUTER SCIENCE;

GRAPH THEORY;

EID: 84855394417     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25870-1_28     Document Type: Conference Paper

References (17)

1. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. System Sci. 75(8), 423-434 (2009)
2. Cayley, A.: A theorem on trees. Quart. J. Math. 23, 376-378 (1889)
3. Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility Through Colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 378-389. Springer, Heidelberg (2009)
4. Dorn, F., Moser, H., Niedermeier, R., Weller, M.: Efficient Algorithms for Eulerian Extension. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 100-111. Springer, Heidelberg (2010)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
6. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: The rural postman problem. Oper. Res. 43(3), 399-414 (1995)
7. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
8. Frederickson, G.N.: Approximation Algorithms for NP-hard Routing Problems. PhD thesis, Faculty of the Graduate School of the University of Maryland (1977)
9. Frederickson, G.N.: Approximation algorithms for some postman problems. J. ACM 26(3), 538-554 (1979)
10. Höhn, W., Jacobs, T., Megow, N.: On Eulerian extensions and their application to no-wait flowshop scheduling. J. Sched. (to appear, 2011)
11. Kapoor, S., Ramesh, H.: Algorithms for enumerating all spanning trees of undirected and weighted graphs. SIAM J. Comput. 24, 247-265 (1995)
12. Lenstra, J.K., Kan, A.H.G.R.: On general routing problems. Networks 6(3), 273-280 (1976)
13. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)
14. Orloff, C.S.: A fundamental problem in vehicle routing. Networks 4(1), 35-64 (1974)
15. Orloff, C.S.: On general routing problems: Comments. Networks 6(3), 281-284 (1976)
16. Sorge, M.: On Making Directed Graphs Eulerian. Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena,Available electronically. arXiv:1101.4283 [cs.DM] (2011)
17. Sorge, M., van Bevern, R., Niedermeier, R.,Weller, M.: A New View on Rural Postman Based on Eulerian Extension and Matching. In: Iliopoulos, C.S. (ed.) IWOCA 2011. LNCS, vol. 7056, pp. 310-322. Springer, Heidelberg (2011)