Heuristics for semirandom graph problems (Q1604213): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcss.2001.1773 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987178221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Technique for Coloring Random 3-Colorable Graphs / 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: Q4705344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Random and Semi-Random k-Colorable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum independent sets by excluding subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized graph products, chromatic numbers, and the Lovász \(\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: Finding and certifying a large hidden clique in a semirandom graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum bisection size (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3122905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eigenvalues of random symmetric matrices / 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: A still better performance guarantee for approximate graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / 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: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252731 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCSS.2001.1773 / rank
 
Normal rank

Latest revision as of 22:28, 10 December 2024

scientific article
Language Label Description Also known as
English
Heuristics for semirandom graph problems
scientific article

    Statements

    Heuristics for semirandom graph problems (English)
    0 references
    0 references
    0 references
    4 July 2002
    0 references
    semirandom graph
    0 references
    independent sets
    0 references
    colorings
    0 references
    bisections in graphs
    0 references

    Identifiers