Results 11 to 20 of about 467 (123)
Treedepth Inapproximability and Exponential ETH Lower Bound
CoRRTreedepth is a central parameter to algorithmic graph theory. The current state-of-the-art in computing and approximating treedepth consists of a $2^{O(k^2)} n$-time exact algorithm and a polynomial-time $O(\text{OPT} \log^{3/2} \text{OPT})$-approximation algorithm, where the former algorithm returns an elimination forest of height $k$ (witnessing that
Bonnet, É., Neuen, D., Sokołowski, M.
core +13 more sources
Parameterized Algorithms for MILPs with Small Treedepth
Proceedings of the AAAI Conference on Artificial Intelligence, 2021 Solving (mixed) integer (linear) programs, (M)I(L)Ps for short, is a fundamental optimisation task with a wide range of applications in artificial intelligence and computer science in general. While hard in general, recent years have brought about vast progress for solving structurally restricted, (non-mixed) ILPs: n-fold, tree-fold, 2-stage stochastic
Cornelius Brand +2 more
core +11 more sources
Computing treedepth in polynomial space and linear fpt time [PDF]
CoRR, 2022 The treedepth of a graph $G$ is the least possible depth of an elimination forest of $G$: a rooted forest on the same vertex set where every pair of vertices adjacent in $G$ is bound by the ancestor/descendant relation. We propose an algorithm that given a graph $G$ and an integer $d$, either finds an elimination forest of $G$ of depth at most $d$ or ...
Nadara, Wojciech +2 more
core +9 more sources
An Algorithm for the Exact Treedepth Problem [PDF]
CoRR, 2020 14 pages, 6 figures, 2 tables. This is an extended version of a paper to appear in the proceedings of SEA 2020. The arXiv version is the conference version plus Appendix A (a correctness proof)
Trimble, James
openaire +6 more sources
MaxSAT-Based Postprocessing for Treedepth
, 2020 Treedepth is an increasingly popular graph invariant. Many NP-hard combinatorial problems can be solved efficiently on graphs of bounded treedepth. Since the exact computation of treedepth is itself NP-hard, recent research has focused on the development of heuristics that compute good upper bounds on the treedepth.
Vaidyanathan Peruvemba Ramaswamy +1 more
openaire +3 more sources
Sallow: a heuristic algorithm for treedepth decompositions [PDF]
CoRR, 2020 We describe a heuristic algorithm for computing treedepth decompositions, submitted for the PACE 2020 challenge. It relies on a variety of greedy algorithms computing elimination orderings, as well as a Divide & Conquer approach on balanced cuts obtained using a from-scratch reimplementation of the 2016 FlowCutter algorithm by Hamann & Strasser
Wrochna, Marcin
core +6 more sources
About Treedepth and Related Notions
, 2017 Dissertation, RWTH Aachen University, 2017; Aachen 1 Online-Ressource (getrennte Zählung) : Illustrationen (2017).
Sanchez Villaamil, Fernando
openaire +3 more sources
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space [PDF]
SIAM Journal on Discrete Mathematics, 2020 Presented at WG2020.
Jesper Nederlof +3 more
core +14 more sources
Local search for valued constraint satisfaction parameterized by treedepth [PDF]
CoRR7 pgs; removed prior false claim on short ascents in bounded treedepth ...
Kaznatcheev, Artem
core +4 more sources
An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set
CoRR, 2022 We study the CONNECTED η-TREEDEPTH DELETION problem where the input instance is an undireted graph G = (V, E) and an integer k. The objective is to decide if G has a set S \subseteq V(G) of at most k vertices such that G - S has treedepth at most ηand G[S] is connected.
Eduard Eiben +2 more
openaire +3 more sources