Principles of cost minimisation in wireless networks

DOI10.1007/s10732-005-0433-yzbMath1122.90315OpenAlexW2060831714WikidataQ105047194 ScholiaQ105047194MaRDI QIDQ2573007

Vic Grout

Publication date: 7 November 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://glyndwr.collections.crest.ac.uk/175/1/fulltext.pdf

zbMATH Keywords

wireless networkspath constraintsadd algorithmdrop algorithmedge constraintsload constraintsminimum connected vertex cover problemnode constraints

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

Connected Vertex Covers in Dense Graphs

Cites Work

• A note on two problems in connexion with graphs
• Network Optimization Problems: Algorithms, Applications and Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Principles of cost minimisation in wireless networks