An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Avrim L. Blum / rank
Normal rank
 
Property / author
 
Property / author: David R. Karger / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6588281 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph coloring
Property / zbMATH Keywords: graph coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
analysis of algorithms
Property / zbMATH Keywords: analysis of algorithms / rank
 
Normal rank
Property / author
 
Property / author: Avrim L. Blum / rank
 
Normal rank
Property / author
 
Property / author: David R. Karger / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved non-approximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers and an approximation algorithm for the vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance guarantee for approximate graph coloring / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(96)00190-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1529433769 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:59, 30 July 2024

scientific article
Language Label Description Also known as
English
An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
scientific article

    Statements

    An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (English)
    0 references
    1 June 2016
    0 references
    graph coloring
    0 references
    approximation algorithms
    0 references
    analysis of algorithms
    0 references
    0 references
    0 references

    Identifiers

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