Output sensitive algorithms for covering many points

Discrete Algorithms In this paper we devise some output sensitive algorithms for a problem where a set of points and a positive integer, m, are given and the goal is to cover a maximal number of these points with m disks. We introduce a parameter, ρ, as the maximum number of points that one disk can...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Mathematics and Theoretical Computer Science Ročník 17 no. 1; číslo Discrete Algorithms; s. 309 - 316
Hlavní autori:	Ghasemalizadeh, Hossein, Razzazi, Mohammadreza
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	DMTCS 01.01.2015 Discrete Mathematics & Theoretical Computer Science
Predmet:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [info.info-hc] computer science [cs]/human-computer interaction [cs.hc] Algorithms computational geometry Computer Science covering with disks Discrete Mathematics Fuzzy sets Human-Computer Interaction Mathematical research output sensitive algorithm Set theory Storage media computational geometry output sensitive algorithm covering with disks
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!