Network construction with subgraph connectivity constraints

Dana Angluin (), James Aspnes () and Lev Reyzin ()
Additional contact information
Dana Angluin: Yale University
James Aspnes: Yale University
Lev Reyzin: University of Illinois at Chicago

Journal of Combinatorial Optimization, 2015, vol. 29, issue 2, No 6, 418-432

Abstract: Abstract We consider the problem introduced by Korach and Stern (Mathematical Programming, 98:345–414, 2003) of building a network given connectivity constraints. A network designer is given a set of vertices $$V$$ and constraints $$S_i \subseteq V$$ , and seeks to build the lowest cost set of edges $$E$$ such that each $$S_i$$ induces a connected subgraph of $$(V,E)$$ . First, we answer a question posed by Korach and Stern (Discrete Applied Mathematics, 156:444–450, 2008): for the offline version of the problem, we prove an $$\varOmega (\log n)$$ hardness of approximation result for uniform cost networks (where edge costs are all $$1$$ ) and give an algorithm that almost matches this bound, even in the arbitrary cost case. Then we consider the online problem, where the constraints must be satisfied as they arrive. We give an $$O(n\log n)$$ -competitive algorithm for the arbitrary cost online problem, which has an $$\varOmega (n)$$ -competitive lower bound. We look at the uniform cost case as well and give an $$O(n^{2/3}\log ^{2/3} n)$$ -competitive algorithm against an oblivious adversary, as well as an $$\varOmega (\sqrt{n})$$ -competitive lower bound against an adaptive adversary. We also examine cases when the underlying network graph is known to be a star or a path and prove matching upper and lower bounds of $$\Theta (\log n)$$ on the competitive ratio for them.

Keywords: Network optimization; Subgraph constraints; Connectivity (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9603-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:2:d:10.1007_s10878-013-9603-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9603-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().