570 search results - page 47 / 114 » Approximating Some Network Design Problems with Node Costs |
123
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
129
Voted
AAIM
2009
Springer
15 years 10 months ago
2009
Springer
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
128
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
160
Voted
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
159
Voted
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...