752 search results - page 58 / 151 » Faster approximation algorithms for the minimum latency prob... |
122
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
129
click to vote
GPC
2007
Springer
15 years 9 months ago
2007
Springer
This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network...
241
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
106
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
130
click to vote
EOR
2002
15 years 3 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...