Half-integrality, LP-branching and FPT Algorithms
From MaRDI portal
Publication:5384090
DOI10.1137/1.9781611973402.128zbMath1418.68107arXiv1310.2841OpenAlexW4214877845MaRDI QIDQ5384090
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.2841
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set, Designing FPT Algorithms for Cut Problems Using Randomized Contractions, Towards a polynomial kernel for directed feedback vertex set, Kernels for deletion to classes of acyclic digraphs, Synchronization problems in computer vision with closed-form solutions, Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover, A randomized polynomial kernel for subset feedback vertex set, Edge bipartization faster than \(2^k\), Unnamed Item, Subset feedback vertex set in chordal and split graphs, Half-integrality, LP-branching, and FPT Algorithms, Parameterised algorithms for deletion to classes of DAGs, A Linear-Time Parameterized Algorithm for Node Unique Label Cover, The Power of Linear Programming for General-Valued CSPs, Fixed-parameter tractability for subset feedback set problems with parity constraints, On group feedback vertex set parameterized by the size of the cutset
