A $\frac{5}{2}$-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817): Difference between revisions

@@ Property / OpenAlex ID @@
+W3016149321
@@ Property / OpenAlex ID: W3016149321 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07867
@@ Property / arXiv ID: 1805.07867 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753727
@@ Property / cites work: Q2753727 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4791663
@@ Property / cites work: Q4791663 / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2004
@@ Property / cites work: STACS 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Path Coloring in Trees
+Normal rank
@@ Property / cites work @@
+Q4373682
@@ Property / cites work: Q4373682 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of path coloring and call scheduling
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+The edge intersection graphs of paths in a tree
@@ Property / cites work: The edge intersection graphs of paths in a tree / rank @@
+Normal rank
@@ Property / cites work @@
+Q3576666
@@ Property / cites work: Q3576666 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Intersection Models of Weakly Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Weakly triangulated graphs
@@ Property / cites work: Weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for weakly chordal graphs
@@ Property / cites work: Improved algorithms for weakly chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Constant tolerance intersection graphs of subtrees of a tree
+Normal rank
@@ Property / cites work @@
+Efficient wavelength routing on directed fiber trees
+Normal rank
@@ Property / cites work @@
+Constrained bipartite edge coloring with applications to wavelength routing
+Normal rank
@@ Property / cites work @@
+A note on optical routing on trees
@@ Property / cites work: A note on optical routing on trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501821
@@ Property / cites work: Q5501821 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252739
@@ Property / cites work: Q4252739 / rank @@
+Normal rank
@@ Property / cites work @@
+On the $1.1$ Edge-Coloring of Multigraphs
@@ Property / cites work: On the $1.1$ Edge-Coloring of Multigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient routing in all-optical networks
@@ Property / cites work: Efficient routing in all-optical networks / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition by clique separators
@@ Property / cites work: Decomposition by clique separators / rank @@
+Normal rank

A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817): Difference between revisions

Latest revision as of 20:37, 22 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)