Online and approximate network construction from bounded connectivity constraints

DOI10.1007/978-3-030-75242-2_22OpenAlexW3158689281MaRDI QIDQ2692731

Andrzej Lingas, Jesper Jansson, Christos Levcopoulos

Publication date: 22 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_22

zbMATH Keywords

approximation algorithmconnectivityinduced subgraphonline algorithmnetwork optimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• On the approximability and hardness of minimum topic connected overlay and its special instances
• Structure preserving reductions among convex optimization problems
• On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
• The clustering matroid and the optimal clustering tree
• Network construction with subgraph connectivity constraints
• The Online Set Cover Problem
• A linear-time approximation algorithm for the weighted vertex cover problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Constructing scalable overlays for pub-sub with many topics

This page was built for publication: Online and approximate network construction from bounded connectivity constraints