Power optimization for connectivity problems
type: Item
instance of: scholarly article
title: Power optimization for connectivity problems
zbMATH Open document ID: 1192.90173
author: Guy Kortsarz
author: Vahab S. Mirrokni
author: Zeev Nutov
author: Mohammad T. Hajiaghayi
published in: Mathematical Programming. Series A. Series B
publication date: 2007-04-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5145053
MaRDI profile type: Publication
full work available at URL: s10107-006-0057-5
OpenAlex ID: W2162071758
cites work: Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
cites work: An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
cites work: An application of submodular flows
cites work: Improved Approximation Algorithms for Uniform Connectivity Problems
cites work: Biconnectivity approximations and graph carvings
cites work: Power consumption in packet radio networks
cites work: On the hardness of approximating spanners
cites work: Approximating node connectivity problems via set covers
cites work: Approximation algorithm for k-node connected subgraphs via critical graphs
cites work: Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
cites work: Optimization, approximation, and complexity classes
cites work: A Parallel Repetition Theorem
DOI: 10.1007/S10107-006-0057-5
description: scientific article; zbMATH DE number 5145053