The Maximum Binary Tree Problem.
From MaRDI portal
Publication:5874498
DOI10.4230/LIPIcs.ESA.2020.30OpenAlexW3081912664MaRDI QIDQ5874498
Young-San Lin, Shubhang Kulkarni, Karthekeyan Chandrasekaran, Minshen Zhu, Elena Grigorescu, Gabriel I. Istrate
Publication date: 7 February 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12896/pdf/LIPIcs-ESA-2020-30.pdf/
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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
- 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
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Color-coding
- Heapable Sequences and Subseqeuences
- 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.
