1.61-approximation for min-power strong connectivity with two power levels

Gruia Călinescu ()
Additional contact information
Gruia Călinescu: Illinois Institute of Technology

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 17, 239-259

Abstract: Abstract Given a directed simple graph $$G=(V,E)$$ G = ( V , E ) and a cost function $$c:E \rightarrow R_+$$ c : E → R + , the power of a vertex $$u$$ u in a directed spanning subgraph $$H$$ H is given by $$p_H(u) = \max _{uv \in E(H)} c(uv)$$ p H ( u ) = max u v ∈ E ( H ) c ( u v ) , and corresponds to the energy consumption required for wireless node $$u$$ u to transmit to all nodes $$v$$ v with $$uv \in E(H)$$ u v ∈ E ( H ) . The power of $$H$$ H is given by $$p(H) = \sum _{u \in V} p_H(u)$$ p ( H ) = ∑ u ∈ V p H ( u ) . Power Assignment seeks to minimize $$p(H)$$ p ( H ) while $$H$$ H satisfies some connectivity constraint. In this paper, we assume $$E$$ E is bidirected (for every directed edge $$e \in E$$ e ∈ E , the opposite edge exists and has the same cost), while $$H$$ H is required to be strongly connected. Moreover, we assume $$c:E \rightarrow \{A,B\}$$ c : E → { A , B } , where $$0 \le A

Keywords: Approximation algorithm; Power assignment; Matroid matching (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9738-9 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:31:y:2016:i:1:d:10.1007_s10878-014-9738-9

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

DOI: 10.1007/s10878-014-9738-9

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 ().