The Maximum Binary Tree Problem. (Q5874498): Difference between revisions

@@ label / en / label / en @@
+The Maximum Binary Tree Problem.
@@ Property / full work available at URL @@
+https://drops.dagstuhl.de/opus/volltexte/2020/12896/pdf/LIPIcs-ESA-2020-30.pdf/
+Normal rank
@@ Property / OpenAlex ID @@
+W3081912664
@@ Property / OpenAlex ID: W3081912664 / rank @@
+Normal rank
@@ Property / title @@
+The Maximum Binary Tree Problem. (English)
@@ Property / title: The Maximum Binary Tree Problem. (English) / rank @@
+Normal rank
@@ Property / cites work @@
+Q3439691
@@ Property / cites work: Q3439691 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Degree-Constrained Subgraph Problems: Hardness and Approximation Results
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
+Normal rank
@@ Property / cites work @@
+A New Point of NP-Hardness for 2-to-1 Label Cover
@@ Property / cites work: A New Point of NP-Hardness for 2-to-1 Label Cover / rank @@
+Normal rank
@@ Property / cites work @@
+On the heapability of finite partial orders
@@ Property / cites work: On the heapability of finite partial orders / rank @@
+Normal rank
@@ Property / cites work @@
+Additive Guarantees for Degree-Bounded Directed Network Design
+Normal rank
@@ Property / cites work @@
+Narrow sieves for parameterized paths and packings
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Heapable Sequences and Subseqeuences
@@ Property / cites work: Heapable Sequences and Subseqeuences / rank @@
+Normal rank
@@ Property / cites work @@
+A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
+Normal rank
@@ Property / cites work @@
+What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraphs of minimal degree \(k\)
@@ Property / cites work: Subgraphs of minimal degree \(k\) / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum-Degree Steiner Tree to within One of Optimal
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3191580
@@ Property / cites work: Q3191580 / rank @@
+Normal rank
@@ Property / cites work @@
+Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
+Normal rank
@@ Property / cites work @@
+On approximating the longest path in a graph
@@ Property / cites work: On approximating the longest path in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On some network design problems with degree constraints
+Normal rank
@@ Property / cites work @@
+Bandwidth of chain graphs
@@ Property / cites work: Bandwidth of chain graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+Limits and Applications of Group Algebras for Parameterized Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for degree-constrained minimum-cost network-design problems
+Normal rank
@@ Property / cites work @@
+Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
+Normal rank
@@ Property / cites work @@
+Bipartite permutation graphs
@@ Property / cites work: Bipartite permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5874498