Sciweavers

4114 search results - page 23 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
DISOPT
2008
66views more  DISOPT 2008»
15 years 4 months ago
Worst case examples of an exterior point algorithm for the assignment problem
An efficient exterior point simplex type algorithm for the assignment problem has been developed by Paparrizos [K. Paparrizos, An infeasible (exterior point) simplex algorithm for...
Charalampos Papamanthou, Konstantinos Paparrizos, ...
EUROCRYPT
2000
Springer
15 years 7 months ago
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...
Pierrick Gaudry
JMLR
2010
128views more  JMLR 2010»
14 years 11 months ago
Optimal Allocation Strategies for the Dark Pool Problem
We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuousvalued allocations are allowed. We also propose a...
Alekh Agarwal, Peter L. Bartlett, Max Dama
EVOW
2008
Springer
15 years 6 months ago
Efficient Local Search Limitation Strategies for Vehicle Routing Problems
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
Yuichi Nagata, Olli Bräysy
DNA
2004
Springer
15 years 9 months ago
Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
Ji Youn Lee, Hee-Woong Lim, Suk-In Yoo, Byoung-Tak...