Filters








112 Hits in 3.3 sec

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments [article]

Mithilesh Kumar, Daniel Lokshtanov
2015 arXiv   pre-print
Here input is a tournament T and integer k, and the task is to determine whether T has a feedback vertex set of size at most k. We give a new algorithm for Feedback Vertex Set in Tournaments.  ...  In this article we consider the Feedback Vertex Set problem in tournaments.  ...  Faster Algorithm for Tournament Feedback Vertex Set In this section we consider the following problem. We are given as input a tournament T and an integer k, and a pair (M, P ) of vertex set in T .  ... 
arXiv:1510.07676v1 fatcat:c2osprjdbvfsnjo4fgntpaxxzq

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments

Mithilesh Kumar, Daniel Lokshtanov, Marc Herbstritt
2016 Symposium on Theoretical Aspects of Computer Science  
Here the input is a tournament T and an integer k, and the task is to determine whether T has a feedback vertex set of size at most k. We give a new algorithm for Feedback Vertex Set in Tournaments.  ...  In this article we consider the Feedback Vertex Set problem in tournaments.  ...  Faster Algorithm for Tournament Feedback Vertex Set In this section we consider the following problem. We are given as input a tournament T and an integer k, and a pair (M, P ) of vertex sets in T .  ... 
doi:10.4230/lipics.stacs.2016.49 dblp:conf/stacs/KumarL16 fatcat:4mpl7sgm2fhovcjoulgqbnrage

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments

Mithilesh Kumar, Daniel Lokshtanov, Mithilesh Kumar@ii, No
unpublished
Here the input is a tournament T and an integer k, and the task is to determine whether T has a feedback vertex set of size at most k. We give a new algorithm for Feedback Vertex Set in Tournaments.  ...  In this article we consider the Feedback Vertex Set problem in tournaments.  ...  Next we will give an efficient algorithm for d-FVC and show how it can be used to obtain our claimed algorithm S TA C S 2 0 1 6 49:8 Faster Exact and Parameterized Algorithm for Feedback Vertex Set in  ... 
fatcat:pjwb4zpymbdahag7ceeujjqbeq

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments *

Mithilesh Kumar, Daniel Lokshtanov, Mithilesh Kumar@ii, No
unpublished
We give a new algorithm for Feedback Vertex Set in Bipartite Tournaments.  ...  A feedback vertex set is a set S of vertices in T such that T − S is acyclic. In this article we consider the Feedback Vertex Set problem in bipartite tournaments.  ...  F S T T C S 2 0 1 6 24:4 Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments Lemma 3 ([12] ).  ... 
fatcat:kle4awacxnbbheq7skcqtjz6vu

Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments [chapter]

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß
2006 Lecture Notes in Computer Science  
Using our parameterized algorithm for Feedback Vertex Set in tournaments, we also give an exact (not parameterized) algorithm for it running in O (1.709 n ) time, where n is the number of input graph vertices  ...  We show that Feedback Vertex Set in tournaments (FVST) is amenable to the novel iterative compression technique, and we provide a depth-bounded search tree for Feedback Arc Set in bipartite tournaments  ...  Here, we contribute new results concerning the algorithmic tractability of Feedback Arc Set and Feedback Vertex Set in tournaments and bipartite tournaments.  ... 
doi:10.1007/11758471_31 fatcat:3uppqoabzjc37oyqe7tgl6rjre

Fixed-parameter tractability results for feedback set problems in tournaments

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truss
2010 Journal of Discrete Algorithms  
Using our parameterized algorithm for Feedback Vertex Set in tournaments, we also give an exact (not parameterized) algorithm for it running in O (1.709 n ) time, where n is the number of input graph vertices  ...  We show that Feedback Vertex Set in tournaments (FVST) is amenable to the novel iterative compression technique, and we provide a depth-bounded search tree for Feedback Arc Set in bipartite tournaments  ...  Here, we contribute new results concerning the algorithmic tractability of Feedback Arc Set and Feedback Vertex Set in tournaments and bipartite tournaments.  ... 
doi:10.1016/j.jda.2009.08.001 fatcat:qiuhaocrfrcp7aqsbcp3onvjd4

Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics [chapter]

Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
2016 Lecture Notes in Computer Science  
We discuss several fruitful interactions between the development of fixed-parameter algorithms and the design of heuristics for graph modification problems, featuring quite different aspects of mutual  ...  Typically, graph modification problems are NP-hard, making them natural candidates for parameterized complexity studies.  ...  We are grateful to Till Fluschnik and Vincent Froese for feedback to our manuscript.  ... 
doi:10.1007/978-3-662-53174-7_1 fatcat:kegsdk75mncyhjecqz3ztmtffa

Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics [article]

Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
2016 arXiv   pre-print
We discuss several fruitful interactions between the development of fixed-parameter algorithms and the design of heuristics for graph modification problems, featuring quite different aspects of mutual  ...  Typically, graph modification problems are NP-hard, making them natural candidates for parameterized complexity studies.  ...  We are grateful to Till Fluschnik and Vincent Froese for feedback to our manuscript.  ... 
arXiv:1606.03268v1 fatcat:6ucc6vh32rfajofrbdsxtcpznq

Faster FAST(Feedback Arc Set in Tournaments) [article]

Uriel Feige
2009 arXiv   pre-print
We present an algorithm that finds a feedback arc set of size k in a tournament in time n^O(1)2^O(√(k)).  ...  This is asymptotically faster than the running time of previously known algorithms for this problem.  ...  Acknowledgements The trigger to this work was a talk given by Noga Alon at the IPAM Workshop on Probabilistic Techniques and Applications, October 2009.  ... 
arXiv:0911.5094v1 fatcat:37fuxrzdezcddansxittmpvm5i

Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament [article]

Marek Karpinski, Warren Schudy
2010 arXiv   pre-print
We study fixed parameter algorithms for three problems: Kemeny rank aggregation, feedback arc set tournament, and betweenness tournament.  ...  For feedback arc set tournament we give an algorithm with runtime O*(2^O(sqrtOPT)), an improvement on the previously best known O*(OPT^O(sqrtOPT)) (Alon, Lokshtanov and Saurabh 2009).  ...  Acknowledgements We would like to thank Venkat Guruswami, Claire Mathieu, Prasad Raghavendra and Alex Samorodnitsky for interesting remarks and discussions. Bibliography  ... 
arXiv:1006.4396v1 fatcat:xoc3b74vrvbdrfchq5edl7rwgu

Feedback Vertex Sets in Tournaments [article]

Serge Gaspers, Matthias Mnich
2011 arXiv   pre-print
We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs.  ...  The combination of our results yields the fastest known algorithm for finding a minimum size feedback vertex set in a tournament.  ...  Woeginger for help with the presentation of the results.  ... 
arXiv:0905.0567v3 fatcat:5kmiz6hkmjdd7ca7g4h6t5vxne

Feedback Vertex Sets in Tournaments

Serge Gaspers, Matthias Mnich
2012 Journal of Graph Theory  
We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs.  ...  The combination of our results yields the fastest known algorithm for finding a minimum size feedback vertex set in a tournament.  ...  Woeginger for help with the presentation of the results.  ... 
doi:10.1002/jgt.21631 fatcat:h562apgq5fakxkp5sphlullbya

Feedback Vertex Sets in Tournaments [chapter]

Serge Gaspers, Matthias Mnich
2010 Lecture Notes in Computer Science  
We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs.  ...  The combination of our results yields the fastest known algorithm for finding a minimum size feedback vertex set in a tournament.  ...  Woeginger for help with the presentation of the results.  ... 
doi:10.1007/978-3-642-15775-2_23 fatcat:eayp3w4jizgmdimgtgzncydmz4

Exact algorithms via monotone local search

Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2016 Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016  
Feedback Vertex Set, Node Unique Label Cover, and Weighted d-SAT.  ...  Our results demonstrate an interesting and very concrete connection between parameterized algorithms and exact exponential-time algorithms.  ...  However, due to faster known parameterized algorithms for d-Hitting Set, our theorem implies faster exact algorithms for d-Hitting Set with running time (2 − 1 (d−0.9255) ) n .  ... 
doi:10.1145/2897518.2897551 dblp:conf/stoc/FominGLS16 fatcat:owhsq6a7ibcdxkoz72u3he64lm

Exact Algorithms via Monotone Local Search [article]

Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2015 arXiv   pre-print
Feedback Vertex Set, Node Unique Label Cover, and Weighted d-SAT.  ...  Our results demonstrate an interesting and very concrete connection between parameterized algorithms and exact exponential-time algorithms.  ...  However, due to faster known parameterized algorithms for d-Hitting Set, our theorem implies faster exact algorithms for d-Hitting Set with running time (2 − 1 (d−0.9255) ) n .  ... 
arXiv:1512.01621v1 fatcat:rpu436db45bqjfz5auirqcyt5u
« Previous Showing results 1 — 15 out of 112 results