Online and Approximate Network Construction from Bounded Connectivity Constraints (Q6175211): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1142/s0129054122500265 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Online Set Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network construction with subgraph connectivity constraints / 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: Improved approximability and non-approximability results for graph diameter decreasing problems / 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: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability and hardness of minimum topic connected overlay and its special instances / 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 clustering matroid and the optimal clustering tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1142/S0129054122500265 / rank
 
Normal rank

Latest revision as of 19:08, 30 December 2024

scientific article; zbMATH DE number 7729634
Language Label Description Also known as
English
Online and Approximate Network Construction from Bounded Connectivity Constraints
scientific article; zbMATH DE number 7729634

    Statements

    Online and Approximate Network Construction from Bounded Connectivity Constraints (English)
    0 references
    0 references
    0 references
    0 references
    18 August 2023
    0 references
    network optimization
    0 references
    induced subgraph
    0 references
    connectivity
    0 references
    approximation algorithm
    0 references
    online algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references