4110 search results - page 11 / 822 » Efficient algorithms for the 2-gathering problem |
COLT
2008
Springer
15 years 1 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
76
Voted
TPDS
1998
14 years 11 months ago
1998
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
DAM
2010
14 years 11 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
GECCO
2000
Springer
15 years 3 months ago
2000
Springer
This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA t...