Approximation algorithms for the interval constrained coloring problem (Q639285): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Deconstructing Intractability: A Case Study for Interval Constrained Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3579403 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dependent rounding and its applications to approximation algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4474103 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank |
Latest revision as of 11:39, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation algorithms for the interval constrained coloring problem |
scientific article |
Statements
Approximation algorithms for the interval constrained coloring problem (English)
0 references
20 September 2011
0 references
approximation algorithms
0 references
coloring problems
0 references
LP rounding
0 references