82 search results - page 13 / 17 » Tight Approximation Results for General Covering Integer Pro... |
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
—In this paper we study the resource allocation in OFDM-based cognitive radio (CR) networks, under the consideration of many practical limitations such as imperfect spectrum sens...
SODA
1997
ACM
13 years 8 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
CPAIOR
2010
Springer
13 years 10 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
AAAI
2012
11 years 9 months ago
2012
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...