Power assignment for \(k\)-connectivity in wireless ad hoc networks
type: Item
instance of: scholarly article
title: Power assignment for \(k\)-connectivity in wireless ad hoc networks
zbMATH Open document ID: 1079.90512
author: Sam Makki
author: Peng-Jun Wan
author: Chih-Wei Yi
author: X.-H. Jia
author: Dong-Soo Kim
published in: Journal of Combinatorial Optimization
publication date: 2005-06-08T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 2174443
zbMATH Keywords: power assignment
zbMATH Keywords: wireless ad hoc sensor networks
Wikidata QID: Q60402909
MaRDI profile type: Publication
full work available at URL: s10878-005-6858-2
OpenAlex ID: W2129893614
cites work: A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
cites work: Approximation algorithms for minimum-cost k-vertex connected subgraphs
cites work: A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
cites work: An application of submodular flows
cites work: Q3140422
cites work: Q2753740
cites work: On \(k\)-con-critically \(n\)-connected graphs
cites work: Three tree-paths
DBLP publication ID: journals/jco/JiaKMWY05
DOI: 10.1007/S10878-005-6858-2
description: scientific article; zbMATH DE number 2174443