Information Processing Letters
A fast algorithm for computing longest common subsequences
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Approximation Algorithm for Feedback Vertex Sets in Tournaments
SIAM Journal on Computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments
SIAM Journal on Computing
On Feedback Problems in Diagraphs
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
A Min-Max Theorem on Feedback Vertex Sets
Mathematics of Operations Research
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
SIAM Journal on Discrete Mathematics
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics, Probability and Computing
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters
Invitation to data reduction and problem kernelization
ACM SIGACT News
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Improved FPT algorithm for feedback vertex set problem in bipartite tournament
Information Processing Letters
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
Theory of Computing Systems
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
Theory of Computing Systems
Feedback arc set problem in bipartite tournaments
Information Processing Letters
Open problems around exact algorithms
Discrete Applied Mathematics
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
Aggregating inconsistent information: Ranking and clustering
Journal of the ACM (JACM)
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Additive pattern database heuristics
Journal of Artificial Intelligence Research
Fixed-parameter algorithms for cluster vertex deletion
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Improved parameterized upper bounds for vertex cover
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Kernels: annotated, proper and induced
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Improved approximation algorithm for the feedback set problem in a bipartite tournament
Operations Research Letters
Some Parameterized Problems On Digraphs
The Computer Journal
Feedback vertex sets in tournaments
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Comparing and aggregating partial orders with kendall tau distances
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
A polynomial kernel for feedback arc set on bipartite tournaments
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Fixed-parameter complexity of feedback vertex set in bipartite tournaments
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Exploiting a hypergraph model for finding golomb rulers
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A quadratic vertex kernel for feedback arc set in bipartite tournaments
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Feedback Vertex Sets in Tournaments
Journal of Graph Theory
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
Journal of Combinatorial Optimization
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Theory of Computing Systems
Hi-index | 0.00 |
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and improve fixed-parameter tractability results for these problems. 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 based on a new forbidden subgraph characterization. Moreover, we apply the iterative compression technique to d-Hitting Set, which generalizes Feedback Vertex Set in tournaments, and obtain improved upper bounds for the time needed to solve 4-Hitting Set and 5-Hitting Set. 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, answering a question of Woeginger [G.J. Woeginger, Open problems around exact algorithms, Discrete Appl. Math. 156 (3) (2008) 397-405].