On the Hardness of Range Assignment Problems

DOI10.1007/11758471_15MaRDI QIDQ3434550zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the hardness of range assignment problems
• On the minimum cost range assignment problem
• Algorithmic Applications in Management
• Assign ranges in general ad-hoc networks
• Structural Information and Communication Complexity

Cited in

(5)

• On the hardness of range assignment problems
• An average case analysis of the minimum spanning tree heuristic for the power assignment problem
• On the difficulty of range searching.
• Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks
• Complexity of the repeaters allocating problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434550)