Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C15
@@ Property / Mathematics Subject Classification ID: 05C15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6662312
@@ Property / zbMATH DE Number: 6662312 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hardness of approximation
@@ Property / zbMATH Keywords: hardness of approximation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph coloring
@@ Property / zbMATH Keywords: graph coloring / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2016.09.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2525416008
@@ Property / OpenAlex ID: W2525416008 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58203651
@@ Property / Wikidata QID: Q58203651 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Hardness Results for the Maximum Edge q-coloring Problem
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
+Normal rank
@@ Property / cites work @@
+Q4075490
@@ Property / cites work: Q4075490 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Maximum Edge Coloring Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithm for maximum edge coloring
@@ Property / cites work: Approximation algorithm for maximum edge coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow generalizations of Ramsey theory: A survey
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem
+Normal rank
@@ Property / cites work @@
+Edge-colorings with no large polychromatic stars
@@ Property / cites work: Edge-colorings with no large polychromatic stars / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+The Min-max Edge q-Coloring Problem
@@ Property / cites work: The Min-max Edge q-Coloring Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal colorings for properly colored subgraphs
@@ Property / cites work: Minimal colorings for properly colored subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On totally multicolored stars
@@ Property / cites work: On totally multicolored stars / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jda/AdamaszekP16
@@ Property / DBLP publication ID: journals/jda/AdamaszekP16 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:350721