14548 search results - page 222 / 2910 » The Optimal Path-Matching Problem |
125
click to vote
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
113
Voted
TMI
1998
15 years 8 days ago
1998
Abstract—Computerized detection schemes have the potential of increasing diagnostic accuracy in medical imaging by alerting radiologists to lesions that they initially overlooked...
109
click to vote
STOC
2005
ACM
16 years 28 days ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
105
click to vote
SCHEDULING
2010
14 years 11 months ago
2010
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
92
Voted
SIAMJO
2010
14 years 11 months ago
2010
This paper addresses the need for nonlinear programming algorithms that provide fast local convergence guarantees no matter if a problem is feasible or infeasible. We present an a...