On the Hardness of Range Assignment Problems

DOI10.1007/11758471_15zbMath1183.68300OpenAlexW1607129340MaRDI QIDQ3434550

Bernhard Fuchs

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://e-archive.informatik.uni-koeln.de/488/2/zaik2005-488.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Connectivity graphs of uncertainty regions ⋮ Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks ⋮ An average case analysis of the minimum spanning tree heuristic for the power assignment problem

This page was built for publication: On the Hardness of Range Assignment Problems