Approximation of min coloring by moderately exponential algorithms (Q989534): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2009.05.002 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2159978956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation of Min Set Cover by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal independent sets with applications to graph colouring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations for weighted and unweighted graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A still better performance guarantee for approximate graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: z-Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2009.05.002 / rank
 
Normal rank

Latest revision as of 11:32, 10 December 2024

scientific article
Language Label Description Also known as
English
Approximation of min coloring by moderately exponential algorithms
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references