334 search results - page 33 / 67 » Approximation Algorithms for Non-Uniform Buy-at-Bulk Network... |
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
ESANN
2007
13 years 10 months ago
2007
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
COCOON
2011
Springer
12 years 8 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...