Sciweavers

3656 search results - page 121 / 732
» Compact Location Problems
Sort
View
105
Voted
ESA
2007
Springer
97views Algorithms» more  ESA 2007»
15 years 7 months ago
To Fill or Not to Fill: The Gas Station Problem
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
Samir Khuller, Azarakhsh Malekian, Julián M...
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
15 years 5 months ago
Approximation Schemes for Euclidean k-Medians and Related Problems
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
Sanjeev Arora, Prabhakar Raghavan, Satish Rao
84
Voted
FLAIRS
2010
15 years 1 months ago
Problem Solving by English Learners and English Primary Students in an Algebra Readiness ITS
Problem solving was compared for English Learners and English Primary students who had used AnimalWatch, an algebra-readiness ITS. Data records for word problems solved by student...
Federico Cirett, Carole R. Beal
82
Voted
FMSD
2007
97views more  FMSD 2007»
15 years 21 days ago
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
Patricia Bouyer, Thomas Brihaye, Véronique ...
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 13 days ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende