NDLI: Approximate Min-Power Strong Connectivity

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Calinescu, G.
Copyright Year	2013
Abstract	Given a directed simple graph $G=(V,E)$ and a cost function $c:E \rightarrow R_+$, the power of a vertex $u$ in a directed spanning subgraph $H$ is given by $p_H(u) = \max_{uv \in E(H)} c(uv)$, and corresponds to the energy consumption required for wireless node $u$ to transmit to all nodes $v$ with $uv \in E(H)$. The power of $H$ is given by $p(H) = \sum_{u \in V} p_H(u)$. Power Assignment seeks to minimize $p(H)$ while $H$ satisfies some connectivity constraint. In this paper, we assume $E$ is bidirected (for every directed edge $e \in E$, the opposite edge exists and has the same cost), while $H$ is required to be strongly connected. This is the original power assignment problem introduced by Chen and Huang in 1989, who proved that a bidirected minimum spanning tree has approximation ratio at most 2 (this is tight). In 2010, we introduced a greedy approximation algorithm and claimed a ratio of 1.992. Here we improve the algorithm's analysis to 1.85, combining techniques from Robins and Zelikovsky in 2000 for Steiner Tree, and Caragiannis, Flammini, and Moscardelli in 2007 for the broadcast version of Power Assignment, together with a simple idea inspired by Byrka and coworkers in 2010. The proof also shows that a natural linear programming relaxation, introduced by Calinescu and Qiao in 2012, has integrality gap at most 1.85.
Starting Page	1527
Ending Page	1543
Page Count	17
File Format	PDF
ISSN	08954801
DOI	10.1137/100819540
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	3
Volume Number	27
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2013-09-19
Access Restriction	Subscribed
Subject Keyword	submodular function Approximation methods and heuristics Graph theory approximation algorithms Network design and communication Programming involving graphs or networks power assignment Connectivity Approximation algorithms Directed graphs (digraphs), tournaments Graph algorithms network design greedy algorithm Analysis of algorithms Communication networks
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs

Approximate min-power strong connectivity.

Approximating the Minimum Equivalent Digraph

Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching

Computing the 2-blocks of directed graphs

Strong arc decompositions of split digraphs

Forests and the Strong Erdos-Hajnal Property

Galaxies and the Strong Erdos-Hajnal Property

Optimal Reduction of Two-Terminal Directed Acyclic Graphs

Approximate Min-Power Strong Connectivity

Similar Documents

Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs

Approximate min-power strong connectivity.

Approximating the Minimum Equivalent Digraph

Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching

Computing the 2-blocks of directed graphs

Strong arc decompositions of split digraphs

Forests and the Strong Erdos-Hajnal Property

Galaxies and the Strong Erdos-Hajnal Property

Optimal Reduction of Two-Terminal Directed Acyclic Graphs

Approximate Min-Power Strong Connectivity