4894 search results - page 115 / 979 » The Guarding Problem - Complexity and Approximation |
156
click to vote
ORL
1998
15 years 6 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
159
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
: We consider mixed Dirichlet-Robin problems on scale irregular domains. In particular, we study the asymptotic convergence of the solutions of elliptic problems with Robin boundar...
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
142
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
138
click to vote
MOR
2002
15 years 6 months ago
2002
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...