4843 search results - page 124 / 969 » The Shortcut Problem - Complexity and Approximation |
76
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
AAIM
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
WSC
2008
15 years 15 days ago
2008
We study a stochastic optimization problem that has its roots in financial portfolio design. The problem has a specified deterministic objective function and constraints on the co...
TALG
2010
14 years 8 months ago
2010
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...