Mostra el registre d'ítem simple
Matching random colored points with rectangles
dc.contributor.author | Corujo, Josué |
dc.contributor.author | Flores Peñaloza, David |
dc.contributor.author | Huemer, Clemens |
dc.contributor.author | Seara Ojea, Carlos |
dc.contributor.author | Pérez Lantero, Pablo |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2022-05-30T11:08:43Z |
dc.date.available | 2022-05-31T00:29:08Z |
dc.date.issued | 2020 |
dc.identifier.citation | Corujo, J. [et al.]. Matching random colored points with rectangles. A: International Workshop on Algorithms and Computation. "WALCOM: algorithms and computation: 14th international conference, WALCOM 2020, Singapore, Singapore, March 31-April 2, 2020: proceedings". Berlín: Springer, 2020, p. 261-272. ISBN 978-3-030-39881-1. DOI 10.1007/978-3-030-39881-1_22. |
dc.identifier.isbn | 978-3-030-39881-1 |
dc.identifier.uri | http://hdl.handle.net/2117/367810 |
dc.description.abstract | Let S[0,1]2 be a set of n points, randomly and uniformly selected. Let RB be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study the random variable M(n) equal to the number of points of S that are covered by the rectangles of a maximum strong matching of S with axis-aligned rectangles. The matching consists of closed rectangles that cover exactly two points of S of the same color. A matching is strong if all its rectangles are pairwise disjoint. We prove that almost surely M(n)=0.83n for n large enough. Our approach is based on modeling a deterministic greedy matching algorithm, that runs over the random point set, as a Markov chain. |
dc.description.sponsorship | Research supported by projects MTM2015-63791-R MINECO/FEDER and Gen. Cat. DGR 2017SGR1640 |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.publisher | Springer |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional |
dc.subject.lcsh | Computational geometry |
dc.title | Matching random colored points with rectangles |
dc.type | Conference report |
dc.subject.lemac | Geometria computacional |
dc.contributor.group | Universitat Politècnica de Catalunya. DCG - Discrete and Combinatorial Geometry |
dc.contributor.group | Universitat Politècnica de Catalunya. CGA - Computational Geometry and Applications |
dc.identifier.doi | 10.1007/978-3-030-39881-1_22 |
dc.relation.publisherversion | https://link.springer.com/chapter/10.1007/978-3-030-39881-1_22 |
dc.rights.access | Open Access |
local.identifier.drac | 30517159 |
dc.description.version | Postprint (author's final draft) |
dc.relation.projectid | info:eu-repo/grantAgreement/MINECO//MTM2015-63791-R/ES/GRAFOS Y GEOMETRIA: INTERACCIONES Y APLICACIONES/ |
dc.relation.projectid | info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT |
local.citation.author | Corujo, J.; Flores, D.; Huemer, C.; Seara, C.; Perez-Lantero, P. |
local.citation.contributor | International Workshop on Algorithms and Computation |
local.citation.pubplace | Berlín |
local.citation.publicationName | WALCOM: algorithms and computation: 14th international conference, WALCOM 2020, Singapore, Singapore, March 31-April 2, 2020: proceedings |
local.citation.startingPage | 261 |
local.citation.endingPage | 272 |