On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Inferring Social Networks from Outbreaks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure preserving reductions among convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing scalable overlays for pub-sub with many topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new multilayered PCP and the hardness of hypergraph vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2701740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / 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 complete optimal stars-clustering-tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clustering matroid and the optimal clustering tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient fixed-parameter algorithms for weighted vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank

Latest revision as of 07:23, 5 July 2024

scientific article
Language Label Description Also known as
English
On the approximability and hardness of minimum topic connected overlay and its special instances
scientific article

    Statements

    On the approximability and hardness of minimum topic connected overlay and its special instances (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    topic-connected overlay
    0 references
    approximation algorithm
    0 references
    APX
    0 references
    hardness
    0 references
    0 references