FPT algorithms for path-transversal and cycle-transversal problems

Discrete Optimization

Volumn 8, Issue 1, 2011, Pages 61-71

  Guillemot, Sylvain ^a  

^a Université de Marne la Vallée   (France)

Author keywords

Cut problems; Feedback set problems; Fixed parameter algorithms; Linear programming

Indexed keywords

CUT PROBLEMS; FEEDBACK SET PROBLEM; FEEDBACK SET PROBLEMS; FIXED-PARAMETER ALGORITHMS; FPT ALGORITHMS; PARAMETERIZED; PARAMETERIZED COMPLEXITY; SEPARATION PROBLEMS; UNDIRECTED GRAPH;

ALGORITHMS; LINEAR PROGRAMMING; OPTIMIZATION; PARAMETER ESTIMATION;

GRAPH THEORY;

EID: 79952196090     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2010.05.003     Document Type: Article

References (16)

1. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer-Verlag
2. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer-Verlag
3. R. Niedermeier Invitation to Fixed-Parameter Algorithms 2006 Oxford University Press
4. D. Mrx Parameterized graph separation problems Theoret. Comput. Sci. 351 2006 394 406
5. J. Chen, Y. Liu, and S. Lu An improved parameterized algorithm for the minimum node multiway cut problem Algorithmica 55 1 2009 1 13
6. M. Xiao Algorithms for multiterminal cuts Proc. CSR 2008 Lecture Notes in Computer Science vol. 5010 2008 314 325 (Pubitemid 351776141)
7. J. Chen, F.V. Fomin, Y. Liu, S. Lu, and Y. Villanger Improved algorithms for feedback vertex set problems J. Comput. System Sci. 74 7 2008 1188 1198
8. B. Reed, K. Smith, and A. Vetta Finding odd cycle transversals Oper. Res. Lett. 32 4 2004 299 301
9. J. Chen, Y. Liu, S. Lu, B. O'Sullivan, and I. Razgon A fixed-parameter algorithm for the directed feedback vertex set problem J. ACM 55 5 2008
10. M. Chudnovsky, J. Geelen, B. Gerards, L.A. Goddyn, M. Lohman, and P.D. Seymour Packing non-zero A-paths in group-labelled graphs Combinatorica 5 26 2006 521 532
11. K.I. Kawarabayashi, and P. Wollan Non-zero disjoint cycles in highly connected group labeled graphs J. Combin. Theory Ser. B 96 2006 296 301 (Pubitemid 43231292)
12. N. Garg, V. Vazirani, and M. Yannakakis Multiway cuts in directed and node weighted graphs Proc. ICALP'94 Lecture Notes in Computer Science vol. 820 1994 487 498
13. J. Edmonds Path, trees and flowers Canad. J. Math. 17 1965 449 467
14. J. Guo, H. Moser, and R. Niedermeier Iterative compression for exactly solving NP-hard minimization problems Algorithmics of Large and Complex Networks Lecture Notes in Computer Science vol. 5515 2009 65 80
15. S. Khot, On the power of unique 2-prover 1-round games, in: Proc. STOC'02, 2002, pp. 767775. (Pubitemid 35009440)
16. A. Gupta, K. Talwar, Approximating unique games, in: Proc. SODA'06, 2006, pp. 99106. (Pubitemid 43275229)