2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409): 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 / author
 
Property / author: I. I. Ëremin / rank
Normal rank
 
Property / author
 
Property / author: E. Kh. Gimadi / rank
Normal rank
 
Property / author
 
Property / author: Alexander Kel'Manov / rank
Normal rank
 
Property / author
 
Property / author: Artem V. Pyatkin / rank
Normal rank
 
Property / author
 
Property / author: Q463370 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6381066 / rank
 
Normal rank
Property / zbMATH Keywords
 
complete undirected graph
Property / zbMATH Keywords: complete undirected graph / rank
 
Normal rank
Property / zbMATH Keywords
 
clique of fixed size
Property / zbMATH Keywords: clique of fixed size / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum weight of vertices and edges
Property / zbMATH Keywords: minimum weight of vertices and edges / rank
 
Normal rank
Property / zbMATH Keywords
 
subset search
Property / zbMATH Keywords: subset search / rank
 
Normal rank
Property / zbMATH Keywords
 
approximability
Property / zbMATH Keywords: approximability / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial time approximation algorithm
Property / zbMATH Keywords: polynomial time approximation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation guarantee
Property / zbMATH Keywords: approximation guarantee / rank
 
Normal rank
Property / zbMATH Keywords
 
time complexity
Property / zbMATH Keywords: time complexity / rank
 
Normal rank
Property / author
 
Property / author: I. I. Ëremin / rank
 
Normal rank
Property / author
 
Property / author: E. Kh. Gimadi / rank
 
Normal rank
Property / author
 
Property / author: Alexander Kel'Manov / rank
 
Normal rank
Property / author
 
Property / author: Artem V. Pyatkin / rank
 
Normal rank
Property / author
 
Property / author: Mikhail Yu. Khachay / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extended formulation approach to the edge-weighted maximal clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:44, 9 July 2024

scientific article
Language Label Description Also known as
English
2-approximation algorithm for finding a clique with minimum weight of vertices and edges
scientific article

    Statements

    2-approximation algorithm for finding a clique with minimum weight of vertices and edges (English)
    0 references
    17 December 2014
    0 references
    complete undirected graph
    0 references
    clique of fixed size
    0 references
    minimum weight of vertices and edges
    0 references
    subset search
    0 references
    approximability
    0 references
    polynomial time approximation algorithm
    0 references
    approximation guarantee
    0 references
    time complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers