The Maximum Binary Tree Problem.
From MaRDI portal
Publication:5874498
DOI10.4230/LIPICS.ESA.2020.30OpenAlexW3081912664MaRDI QIDQ5874498FDOQ5874498
Authors: Karthekeyan Chandrasekaran, Elena Grigorescu, Shubhang Kulkarni, Young-San Lin, Minshen Zhu, Gabriel 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/
Recommendations
- The maximum binary tree problem
- scientific article; zbMATH DE number 1253054
- Maximal path length of binary trees
- The \(p\)-maxian problem on a tree
- Maximal covering tree problems
- Binary trees with the largest number of subtrees
- The maximum utilization subtree problem
- Trees with maximum number of maximal matchings
- The number of maximum matchings in a tree
- scientific article; zbMATH DE number 644325
Cites Work
- Title not available (Why is that?)
- Narrow sieves for parameterized paths and packings
- Faster Algebraic Algorithms for Path and Packing Problems
- Limits and Applications of Group Algebras for Parameterized Problems
- Color-coding
- Automata, Languages and Programming
- Parameterized Algorithms
- Algorithms and Computation
- On approximating the longest path in a graph
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Bipartite permutation graphs
- On some network design problems with degree constraints
- Bandwidth of chain graphs
- Title not available (Why is that?)
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
- Additive guarantees for degree-bounded directed network design
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- Subgraphs of minimal degree \(k\)
- Approximation algorithms for degree-constrained minimum-cost network-design problems
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
- Heapable Sequences and Subseqeuences
- Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
- A New Point of NP-Hardness for 2-to-1 Label Cover
- Improved inapproximability results for maximum \(k\)-colorable subgraph
- On the heapability of finite partial orders
Cited In (3)
This page was built for publication: The Maximum Binary Tree Problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874498)
