1941 search results - page 58 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
MST
1998
14 years 9 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
SAC
2005
ACM
15 years 3 months ago
2005
ACM
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
109
click to vote
MST
2011
14 years 4 months ago
2011
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We ï¬rst investigate symmet...