Introduces exact and FPT algorithms for computing the scanwidth of DAGs and phylogenetic networks, plus a heuristic with good practical performance.
A Dynamic Programming Approach to Sequencing Problems
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Exhaustively parametrised feasibility-respecting quantum circuits can reach every feasible solution to problems like TSP with certainty using fixed parameters by leveraging group actions and generating sequences.
Proves upper and lower bounds on the gap between minimum sum set cover cost and standard set cover size for hypergraphs and graphs, plus an FPT algorithm for bounded-rank hypergraphs parameterized by the sum cost.
citing papers explorer
-
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
Introduces exact and FPT algorithms for computing the scanwidth of DAGs and phylogenetic networks, plus a heuristic with good practical performance.
-
Exhaustive and feasible parametrisation with applications to the travelling salesperson problem
Exhaustively parametrised feasibility-respecting quantum circuits can reach every feasible solution to problems like TSP with certainty using fixed parameters by leveraging group actions and generating sequences.
-
Minimum Sum Set Cover: Structures and Algorithm
Proves upper and lower bounds on the gap between minimum sum set cover cost and standard set cover size for hypergraphs and graphs, plus an FPT algorithm for bounded-rank hypergraphs parameterized by the sum cost.