Greed is good for deterministic scale-free networks (Q2205637): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s00453-020-00729-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3035973118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random graph model for massive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Random Graph Model for Power Law Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomized graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Complexity of Power Law Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric inhomogeneous random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling Geometric Inhomogeneous Random Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating bounded variants of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distances in random graphs with given expected degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected components in random graphs with given expected degree sequences / 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: Concentration of Measure for the Analysis of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxing the uniformity and independence assumptions using the concept of fractal dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of optimization in power-law graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of dominating set on power law graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is good / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrap percolation on geometric inhomogeneous random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Dominating Set Approximation in Graphs of Bounded Arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above or below guaranteed values / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approximation for minimum connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on greedy algorithms for the maximum weighted independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New techniques for approximating optimal substructure problems in power-law graphs / rank
 
Normal rank

Latest revision as of 21:34, 23 July 2024

scientific article
Language Label Description Also known as
English
Greed is good for deterministic scale-free networks
scientific article

    Statements

    Greed is good for deterministic scale-free networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 October 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random graphs
    0 references
    deterministic properties
    0 references
    power-law
    0 references
    approximation
    0 references
    APX-hardness
    0 references
    0 references
    0 references
    0 references