(N, 1, 1, α)-CENTER PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KAVAND P.; MOHADES A.; ESKANDARI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: AMIRKABIR INTERNATIONAL JOURNAL OF MODELING, IDENTIFICATION, SIMULATION AND CONTROL Year:2014 | Volume:46 | Issue:1 Page(s): 57-64

Download Full-Text

View:

252

Download:

Cites:

Information Journal Paper

Title

(N, 1, 1, α)-CENTER PROBLEM

Author(s)

KAVAND P. | MOHADES A. | ESKANDARI M. | Issue Writer Certificate

Keywords

COMPUTATIONAL GEOMETRY

𝐾-CENTER PROBLEM

FARTHEST POINT VORONOI DIAGRAM

CENTER HULL

Abstract

Given a set𝑆 of 𝑛 points in the plane and a constant 𝛼, (𝑛, 1, 1, a) -center problem is to find two closed disks which each covers the whole 𝑆, the diameter of the bigger one is minimized, and the distance of the two centers is at least 𝛼. Constrained (𝑛, 1, 1, a) -center problem is the (𝑛, 1, 1, 𝛼) -center problem in which the centers are forced to lie on a given line 𝐿. In this paper, we first introduce (𝑛, 1, 1, a) -center problem and its constrained version. Then, we present an 𝑂 (𝑛log𝑛) algorithm for solving the (𝑛, 1, 1, a) -center problem. Finally, we propose a linear time algorithm for its constrained version.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

KAVAND, P., MOHADES, A., & ESKANDARI, M.. (2014). (N, 1, 1, α)-CENTER PROBLEM. AMIRKABIR INTERNATIONAL JOURNAL OF MODELING, IDENTIFICATION, SIMULATION AND CONTROL, 46(1), 57-64. SID. https://sid.ir/paper/320038/en

Vancouver: Copy

KAVAND P., MOHADES A., ESKANDARI M.. (N, 1, 1, α)-CENTER PROBLEM. AMIRKABIR INTERNATIONAL JOURNAL OF MODELING, IDENTIFICATION, SIMULATION AND CONTROL[Internet]. 2014;46(1):57-64. Available from: https://sid.ir/paper/320038/en

IEEE: Copy

P. KAVAND, A. MOHADES, and M. ESKANDARI, “(N, 1, 1, α)-CENTER PROBLEM,” AMIRKABIR INTERNATIONAL JOURNAL OF MODELING, IDENTIFICATION, SIMULATION AND CONTROL, vol. 46, no. 1, pp. 57–64, 2014, [Online]. Available: https://sid.ir/paper/320038/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops