Linear-Time FPT Algorithms via Network Flow

@inproceedings{Iwata2014LinearTimeFA,
  title={Linear-Time FPT Algorithms via Network Flow},
  author={Yoichi Iwata and Keigo Oka and Yuichi Yoshida},
  booktitle={SODA},
  year={2014}
}
In the area of parameterized complexity, to cope with NP-Hard problems, we introduce a parameter k besides the input size n, and we aim to design algorithms (called FPT algorithms) that run in O(f(k)n) time for some function f(k) and constant d. Though FPT algorithms have been successfully designed for many problems, typically they are not sufficiently fast because of huge f(k) and d. In this paper, we give FPT algorithms with small f(k) and d for many important problems including Odd Cycle… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.
28 Citations
23 References
Similar Papers

Similar Papers

Loading similar papers…