Sciweavers

371 search results - page 1 / 75
» Algorithms for the transportation problem in geometric setti...
Sort
View
SODA
2012
ACM
224views Algorithms» more  SODA 2012»
11 years 7 months ago
Algorithms for the transportation problem in geometric settings
R. Sharathkumar, Pankaj K. Agarwal
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
13 years 10 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
DCG
2010
137views more  DCG 2010»
13 years 5 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
COCOON
2010
Springer
13 years 9 months ago
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
Piotr Berman, Marek Karpinski, Andrzej Lingas
COMPGEOM
2009
ACM
13 years 11 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray