Name
Abstract | ||
|---|---|---|
In this paper, we study the line-constrained k-center problem in the Euclidean plane. Given a set of demand points and a line L, the problem asks for k points, called center facilities, on L, such that the maximum of the distances from the demand points to their closest center facilities is minimized. For any fixed k, we propose an algorithm with running time linear to the number of demand points. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-41168-2_17 | ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT |
Field | DocType | Volume |
Combinatorics,Computer science,Euclidean geometry | Conference | 9778 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.37 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Albert Jhih-Heng Huang | 1 | 1 | 0.37 |
| Hung-Lung Wang | 2 | 27 | 5.63 |
| Kun-mao Chao | 3 | 838 | 94.05 |