Efficient algorithms for computing one or two discrete centers hitting a set of line segments

Xiaozhou He (), Zhihui Liu (), Bing Su (), Yinfeng Xu (), Feifeng Zheng () and Binhai Zhu ()
Additional contact information
Xiaozhou He: Sichuan University
Zhihui Liu: Shandong Technology and Business University
Bing Su: Xi’an Technological University
Yinfeng Xu: Sichuan University
Feifeng Zheng: Donghua University
Binhai Zhu: Montana State University

Journal of Combinatorial Optimization, 2019, vol. 37, issue 4, No 17, 1408-1423

Abstract: Abstract Given the scheduling model of bike-sharing, we consider the problem of hitting a set of n axis-parallel line segments in $$\mathbb {R}^2$$ R 2 by a square or an $$\ell _\infty $$ ℓ ∞ -circle (and two squares, or two $$\ell _\infty $$ ℓ ∞ -circles) whose center(s) must lie on some line segment(s) such that the (maximum) edge length of the square(s) is minimized. Under a different tree model, we consider (virtual) hitting circles whose centers must lie on some tree edges with similar minmax-objectives (with the distance between a center to a target segment being the shortest path length between them). To be more specific, we consider the cases when one needs to compute one (and two) centers on some edge(s) of a tree with m edges, where n target segments must be hit, and the objective is to minimize the maximum path length from the target segments to the nearer center(s). We give three linear-time algorithms and an $$O(n^2\log n)$$ O ( n 2 log n ) algorithm for the four problems in consideration.

Keywords: One or two discrete centers problem; Hit line segments; Computational geometry (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0359-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:4:d:10.1007_s10878-018-0359-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0359-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().