Inapproximability of dominating set on power law graphs (Q476891): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6375994 / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
inapproximability
Property / zbMATH Keywords: inapproximability / rank
 
Normal rank
Property / zbMATH Keywords
 
power law graphs
Property / zbMATH Keywords: power law graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
dominating set
Property / zbMATH Keywords: dominating set / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964161862 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.3517 / 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: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popularity based random graph models leading to a scale-free degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501331 / 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: Approximability of the vertex cover problem in power-law graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renormalization group analysis of the small-world network model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New techniques for approximating optimal substructure problems in power-law graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:53, 9 July 2024

scientific article
Language Label Description Also known as
English
Inapproximability of dominating set on power law graphs
scientific article

    Statements

    Inapproximability of dominating set on power law graphs (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    inapproximability
    0 references
    power law graphs
    0 references
    combinatorial optimization
    0 references
    dominating set
    0 references
    0 references
    0 references