130 search results - page 22 / 26 » Faster Approximation Algorithms for the Rectilinear Steiner ... |
126
click to vote
TPDS
2008
15 years 3 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
100
click to vote
ICCAD
2006
IEEE
16 years 3 days ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
103
click to vote
ESA
2007
Springer
15 years 9 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
135
click to vote
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
146
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...