Efficient algorithms for Eulerian extension

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

Volumn 6410 LNCS, Issue , 2010, Pages 100-111

  Dorn, Frederic ^a   Moser, Hannes ^b   Niedermeier, Rolf ^b   Weller, Mathias ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COST SET; EFFICIENT ALGORITHM; EULERIAN; FIXED-PARAMETER TRACTABILITY; MULTIGRAPHS; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; RUNNING TIME; RURAL POSTMAN PROBLEM; SCHEDULING AND ROUTING;

COMPUTER SCIENCE; GRAPH THEORY;

ALGORITHMS;

EID: 78650184960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16926-7_11     Document Type: Conference Paper

References (18)

1. http://jorlin.scripts.mit.edu/Solution-Manual.html
2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
3. Boesch, F.T., Suffel, C., Tindell, R.: The spanning subgraphs of Eulerian graphs. J. Graph Theory 1(1), 79-84 (1977)
4. Burzyn, P., Bonomo, F., Durán, G.: NP-completeness results for edge modification problems. Discrete Appl. Math. 154(13), 1824-1844 (2006)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
6. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems part I: The chinese postman problem. Oper. Res. 43(2), 231-242 (1995)
7. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems part II: The rural postman problem. Oper. Res. 43(3), 399-414 (1995)
8. Fellows, M.: Towards fully multivariate algorithmics: Some new results and directions in parameter ecology. In: Fiala, J., Kratochvíl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 2-10. Springer, Heidelberg (2009)
9. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
10. Frederickson, G.N.: Approximation algorithms for some postman problems. J. ACM 26(3), 538-554 (1979)
11. Höhn, W., Jacobs, T., Megow, N.: On Eulerian extension problems and their application to sequencing problems. Technical Report 008, Combinatorial Optimization and Graph Algorithms, TU Berlin (2009)
12. Lenstra, J.K., Kan, A.H.G.R.: On general routing problems. Networks 6(3), 273-280 (1976)
13. Lesniak, L., Oellermann, O.R.: An Eulerian exposition. J. Graph Theory 10(3), 277-297 (1986)
14. Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113, 109-128 (2001)
15. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
16. Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. 27th STACS, IBFI Dagstuhl, Germany. LIPIcs, vol. 5, pp. 17-32 (2010)
17. Orloff, C.S.: On general routing problems: Comments.Networks 6(3), 281-284 (1976)
18. Weller, M., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: On making directed graphs transitive. In: Dehne, F., et al. (eds.) Proc. 11th WADS. LNCS, vol. 5664, pp. 542-553. Springer, Heidelberg (2009)