On percolation and ‐hardness (Q4633317): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1002/rsa.20772 / 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.1002/rsa.20772 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963244154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation on finite graphs and isoperimetric inequalities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weighted vs unweighted versions of combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional Hardness for Approximate Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed Analysis of Local Search for the Maximum-Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for semirandom graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Values for Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing, counting and covering Hamilton cycles in random directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The emergence of a giant component in random subgraphs of pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3122905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Hardness of Approximating Chromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling in cut, flow, and network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in random graphs: A simple proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy coloring is a bad probabilistic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information, Physics, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bogolyubov-Ruzsa lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/RSA.20772 / rank
 
Normal rank

Latest revision as of 14:54, 30 December 2024

scientific article; zbMATH DE number 7050012
Language Label Description Also known as
English
On percolation and ‐hardness
scientific article; zbMATH DE number 7050012

    Statements

    On percolation and ‐hardness (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2019
    0 references
    chromatic number
    0 references
    hardness of approximation
    0 references
    independence number
    0 references
    percolation
    0 references
    random subgraphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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