840 search results - page 33 / 168 » Inapproximability of Combinatorial Optimization Problems |
ATAL
2007
Springer
14 years 5 months ago
2007
Springer
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
INFOCOM
2009
IEEE
14 years 5 months ago
2009
IEEE
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
CPM
1999
Springer
14 years 3 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
SAGA
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
IDEAL
2005
Springer
14 years 4 months ago
2005
Springer
Consider a network of unreliable links, each of which comes with a certain price and reliability. Given a fixed budget, which links should be bought in order to maximize the syste...