Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPpack / rank
 
Normal rank
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.1007/s101070100246 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998838742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Ramsey graphs and orthonormal labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the independence number via the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:42, 10 June 2024

scientific article
Language Label Description Also known as
English
Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
scientific article

    Statements

    Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (English)
    0 references
    0 references
    29 April 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Combinatorial optimization
    0 references
    SDP relaxation
    0 references
    Graph coloring
    0 references
    Lovász \(\theta\)-number
    0 references
    0 references