The maximum binary tree problem
From MaRDI portal
Publication:2041978
DOI10.1007/s00453-021-00836-5OpenAlexW3170602412MaRDI QIDQ2041978
Karthekeyan Chandrasekaran, Shubhang Kulkarni, Gabriel I. Istrate, Young-San Lin, Elena Grigorescu, Minshen Zhu
Publication date: 26 July 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.07915
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained multilinear detection and generalized graph motifs
- Bandwidth of chain graphs
- On some network design problems with degree constraints
- On approximating the longest path in a graph
- Subgraphs of minimal degree \(k\)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
- Bipartite permutation graphs
- Finding and counting vertex-colored subtrees
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
- Narrow sieves for parameterized paths and packings
- Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
- A New Point of NP-Hardness for 2-to-1 Label Cover
- On the heapability of finite partial orders
- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
- Faster Algebraic Algorithms for Path and Packing Problems
- Survivable Network Design with Degree or Order Constraints
- Additive Guarantees for Degree-Bounded Directed Network Design
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- Limits and Applications of Group Algebras for Parameterized Problems
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Color-coding
- The Traveling Salesman Problem with Distances One and Two
- Heapable Sequences and Subseqeuences
- Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
- Automata, Languages and Programming
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
- Parameterized Algorithms
- Algorithms and Computation
- Approximation algorithms for degree-constrained minimum-cost network-design problems
This page was built for publication: The maximum binary tree problem
