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

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/jda/AdamaszekP16, #quickstatements; #temporary_batch_1732532539753
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2016.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2525416008 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58203651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Hardness Results for the Maximum Edge q-coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Maximum Edge Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for maximum edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow generalizations of Ramsey theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings with no large polychromatic stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-max Edge q-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal colorings for properly colored subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On totally multicolored stars / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jda/AdamaszekP16 / rank
 
Normal rank

Latest revision as of 12:02, 25 November 2024

scientific article
Language Label Description Also known as
English
Approximation and hardness results for the maximum edge \(q\)-coloring problem
scientific article

    Statements

    Identifiers