909 search results - page 24 / 182 » On the approximability of some network design problems |
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
119
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
108
click to vote
DISOPT
2008
15 years 1 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
103
click to vote
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
106
click to vote
ALGOSENSORS
2008
Springer
15 years 3 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...