dc.citation.conferencePlace |
GE |
- |
dc.citation.conferencePlace |
Karlsruhe |
- |
dc.citation.endPage |
453 |
- |
dc.citation.startPage |
442 |
- |
dc.citation.title |
16th Annual European Symposium on Algorithms, ESA 2008 |
- |
dc.contributor.author |
Fournier, Herve |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.date.accessioned |
2023-12-20T04:36:29Z |
- |
dc.date.available |
2023-12-20T04:36:29Z |
- |
dc.date.created |
2016-07-04 |
- |
dc.date.issued |
2008-09-15 |
- |
dc.description.abstract |
We consider the problem of fitting a step function to a set of points. More precisely, given an integer k and a set P of n points in the plane, our goal is to find a step function f with k steps that minimizes the maximum vertical distance between f and all the points in P. We first give an optimal Θ(n logn) algorithm for the general case. In the special case where the points in P are given in sorted order according to their x-coordinates, we give an optimal Θ(n) time algorithm. Then, we show how to solve the weighted version of this problem in time O(n log4 n). Finally, we give an O(n h 2 logh) algorithm for the case where h outliers are allowed, and the input is sorted. The running time of all our algorithms is independent of k. |
- |
dc.identifier.bibliographicCitation |
16th Annual European Symposium on Algorithms, ESA 2008, pp.442 - 453 |
- |
dc.identifier.doi |
10.1007/978-3-540-87744-8-37 |
- |
dc.identifier.issn |
0302-9743 |
- |
dc.identifier.scopusid |
2-s2.0-57749183176 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/34471 |
- |
dc.identifier.url |
http://link.springer.com/chapter/10.1007%2F978-3-540-87744-8_37 |
- |
dc.language |
영어 |
- |
dc.publisher |
16th Annual European Symposium on Algorithms, ESA 2008 |
- |
dc.title |
Fitting a step function to a point set |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2008-09-15 |
- |