503 search results - page 14 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
SODA
2012
ACM
12 years 12 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
77
Voted
ESA
2003
Springer
15 years 2 months ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
EUSFLAT
2009
14 years 7 months ago
2009
This paper handles the medical waste disposal facility location problem in Istanbul by using fuzzy TOPSIS (FETOPSIS) to select the adequate place between some candidate points that...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
JAL
2006
14 years 9 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...