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ženo v:
Podrobná bibliografie
Vydáno v:Discrete Mathematics and Theoretical Computer Science Ročník 17 no. 1; číslo Discrete Algorithms; s. 309 - 316
Hlavní autoři: Ghasemalizadeh, Hossein, Razzazi, Mohammadreza
Médium: Journal Article
Jazyk:angličtina
Vydáno: DMTCS 01.01.2015
Discrete Mathematics & Theoretical Computer Science
Témata:
[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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract 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 cover and we analyse the algorithms based on this parameter. At first, we solve the problem for m=1 in O(nρ) time, which improves the previous O(n2) time algorithm for this problem. Then we solve the problem for m=2 in O(nρ + 3 log ρ) time, which improves the previous O(n3 log n) algorithm for this problem. Our algorithms outperform the previous algorithms because ρ is much smaller than n in many cases. Finally, we extend the algorithm for any value of m and solve the problem in O(mnρ + (mρ)2m - 1 log mρ) time. The previous algorithm for this problem runs in O(n2m - 1 log n) time and our algorithm usually runs faster than the previous algorithm because mρ is smaller than n in many cases. We obtain output sensitive algorithms by confining the areas that we should search for the result. The techniques used in this paper may be applicable in other covering problems to obtain faster algorithms.
AbstractList 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 cover and we analyse the algorithms based on this parameter. At first, we solve the problem for m =1 in O(nρ) time, which improves the previous O([n.sup.2]) time algorithm for this problem. Then we solve the problem for m = 2 in O (nρ + [ρ.sub.3] log ρ) time, which improves the previous O ([n.sup.3] log n) algorithm for this problem. Our algorithms outperform the previous algorithms because ρ is much smaller than n in many cases. Finally, we extend the algorithm for any value of m and solve the problem in O(mnρ + [(mρ).sup.2m-1] log mρ) time. The previous algorithm for this problem runs in O([n.sup.2m-1]] log n) time and our algorithm usually runs faster than the previous algorithm because mρ is smaller than n in many cases. We obtain output sensitive algorithms by confining the areas that we should search for the result. The techniques used in this paper may be applicable in other covering problems to obtain faster 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 cover and we analyse the algorithms based on this parameter. At first, we solve the problem for m=1 in O(nρ) time, which improves the previous O(n2) time algorithm for this problem. Then we solve the problem for m=2 in O(nρ + 3 log ρ) time, which improves the previous O(n3 log n) algorithm for this problem. Our algorithms outperform the previous algorithms because ρ is much smaller than n in many cases. Finally, we extend the algorithm for any value of m and solve the problem in O(mnρ + (mρ)2m - 1 log mρ) time. The previous algorithm for this problem runs in O(n2m - 1 log n) time and our algorithm usually runs faster than the previous algorithm because mρ is smaller than n in many cases. We obtain output sensitive algorithms by confining the areas that we should search for the result. The techniques used in this paper may be applicable in other covering problems to obtain faster 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 cover and we analyse the algorithms based on this parameter. At first, we solve the problem for m =1 in O(nρ) time, which improves the previous O([n.sup.2]) time algorithm for this problem. Then we solve the problem for m = 2 in O (nρ + [ρ.sub.3] log ρ) time, which improves the previous O ([n.sup.3] log n) algorithm for this problem. Our algorithms outperform the previous algorithms because ρ is much smaller than n in many cases. Finally, we extend the algorithm for any value of m and solve the problem in O(mnρ + [(mρ).sup.2m-1] log mρ) time. The previous algorithm for this problem runs in O([n.sup.2m-1]] log n) time and our algorithm usually runs faster than the previous algorithm because mρ is smaller than n in many cases. We obtain output sensitive algorithms by confining the areas that we should search for the result. The techniques used in this paper may be applicable in other covering problems to obtain faster algorithms. Keywords: covering with disks, output sensitive algorithm, computational geometry
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 cover and we analyse the algorithms based on this parameter. At first, we solve the problem for m=1 in O(nρ) time, which improves the previous O(n2) time algorithm for this problem. Then we solve the problem for m=2 in O(nρ + 3 log ρ) time, which improves the previous O(n3 log n) algorithm for this problem. Our algorithms outperform the previous algorithms because ρ is much smaller than n in many cases. Finally, we extend the algorithm for any value of m and solve the problem in O(mnρ + (mρ)2m - 1 log mρ) time. The previous algorithm for this problem runs in O(n2m - 1 log n) time and our algorithm usually runs faster than the previous algorithm because mρ is smaller than n in many cases. We obtain output sensitive algorithms by confining the areas that we should search for the result. The techniques used in this paper may be applicable in other covering problems to obtain faster algorithms.
Discrete Algorithms
Audience Academic
Author Ghasemalizadeh, Hossein
Razzazi, Mohammadreza
Author_xml – sequence: 1
  givenname: Hossein
  surname: Ghasemalizadeh
  fullname: Ghasemalizadeh, Hossein
  organization: Software system research and development Laboratory [Tehran]
– sequence: 2
  givenname: Mohammadreza
  orcidid: 0000-0002-3936-6355
  surname: Razzazi
  fullname: Razzazi, Mohammadreza
  organization: Software system research and development Laboratory [Tehran]
BackLink https://inria.hal.science/hal-01196845$$DView record in HAL
BookMark eNptkU9LAzEQxYNU0FZPfoEFTyKt-b_JsYhaodCLnsNsNmkj3U1JYsFv79qKKMgcZni8-THMG6NRH3uH0BXBMy6pVndtV2yeUYLpCTonTIqpwgKPfs1naJzzG8aEal6fI756L7v3UmXX51DC3lWwXccUyqbLlY-psnHvUujXVQf9R7WLoS_5Ap162GZ3-d0n6PXx4eV-MV2unp7v58upZVqUqeYtt7xV2EspNQDV2jKnhMTQeg1SY6mV5DVhDDPNsfa6pZY24IRqmGjYBD0fuW2EN7NLoYP0YSIEcxBiWhtIJditM5Iy3GjdKOUJp7VQTtUNYMWcFAScH1g3R9YGtn9Qi_nSfGmYEC0VF3syeK-P3jUM6ND7WBLYLmRr5pzi4Yu1YoNr9o9rqNZ1wQ7B-DDofxZujws2xZyT8z93EGwO-ZlDfuYrP_YJz0WMkA
ContentType Journal Article
Copyright COPYRIGHT 2015 DMTCS
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: COPYRIGHT 2015 DMTCS
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
1XC
VOOES
DOA
DOI 10.46298/dmtcs.2102
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList


CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
EndPage 316
ExternalDocumentID oai_doaj_org_article_6230b99b88f142758e87ba083e651aef
oai:HAL:hal-01196845v1
A420050783
10_46298_dmtcs_2102
GroupedDBID -~9
.4S
.DC
29G
2WC
5GY
5VS
8FE
8FG
AAFWJ
AAYXX
ABDBF
ABJCF
ABUWG
ACGFO
ACIWK
ACUHS
ADBBV
ADQAK
AENEX
AFFHD
AFKRA
AFPKN
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARCSS
B0M
BAIFH
BBTPI
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
CCPQU
CITATION
EAP
EBS
ECS
EDO
EJD
EMK
EPL
EST
ESX
GROUPED_DOAJ
HCIFZ
I-F
IAO
IBB
ICD
ITC
J9A
KQ8
KWQ
L6V
M7S
MK~
ML~
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
PV9
REM
RNS
RSU
RZL
TR2
TUS
XSB
~8M
M~E
1XC
VOOES
ID FETCH-LOGICAL-c395t-94d4c4d80f6669aa299c3e8560adf9a690698647133039409f9d2c2bae58b35b3
IEDL.DBID DOA
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000365862100004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1365-8050
1462-7264
IngestDate Fri Oct 03 12:53:43 EDT 2025
Sat Nov 29 15:00:45 EST 2025
Wed Mar 19 01:37:56 EDT 2025
Sat Mar 08 18:48:29 EST 2025
Sat Nov 29 02:48:22 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue Discrete Algorithms
Keywords computational geometry
output sensitive algorithm
covering with disks
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c395t-94d4c4d80f6669aa299c3e8560adf9a690698647133039409f9d2c2bae58b35b3
ORCID 0000-0002-3936-6355
OpenAccessLink https://doaj.org/article/6230b99b88f142758e87ba083e651aef
PageCount 8
ParticipantIDs doaj_primary_oai_doaj_org_article_6230b99b88f142758e87ba083e651aef
hal_primary_oai_HAL_hal_01196845v1
gale_infotracmisc_A420050783
gale_infotracacademiconefile_A420050783
crossref_primary_10_46298_dmtcs_2102
PublicationCentury 2000
PublicationDate 2015-01-01
PublicationDateYYYYMMDD 2015-01-01
PublicationDate_xml – month: 01
  year: 2015
  text: 2015-01-01
  day: 01
PublicationDecade 2010
PublicationTitle Discrete Mathematics and Theoretical Computer Science
PublicationYear 2015
Publisher DMTCS
Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: DMTCS
– name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
ssib044734695
Score 1.9463892
Snippet 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...
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...
Discrete Algorithms
SourceID doaj
hal
gale
crossref
SourceType Open Website
Open Access Repository
Aggregation Database
Index Database
StartPage 309
SubjectTerms [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
Title Output sensitive algorithms for covering many points
URI https://inria.hal.science/hal-01196845
https://doaj.org/article/6230b99b88f142758e87ba083e651aef
Volume 17 no. 1
WOSCitedRecordID wos000365862100004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: DOA
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044734695
  issn: 1365-8050
  databaseCode: M~E
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Continental Europe Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BFMQW
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/conteurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: PIMPY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwED7xGmDgjSgvWQiJKZCH09hjQSCQKHQACSbLdmyKRFvUBEZ-O3dJWtGJhSWD4-H0nc93Z5-_AzipYvpE-sD6TAfcchOItokC7VMdO52kRpuq2UR2fy-en2XvV6svqgmr6YFr4M7RPYdGSiOEj3iM0a0TmdEYOLh2GmnnafcNMzlJppr7g1jyrH6Nx9uxFOf5oLTFGaU3M_6noumfbsbz_clhauVcrtdhtYkKWaeWZgPm3HAT1iYdF1hjgJuw0p2yrBZbwB8-S5zACipCp22L6ffXEWb7_UHBMBhlluoz0TexAZo8-xi9DctiG56urx4vb4KmC0JgE5mWgeQ5QpiL0GOmIbVG_2ETJzBS0bmXmoiGiWKdks2Q2pxLL_PYxka7VBjEOtmBheFo6HaBCY-6iHmGAHKOlie9SUzsc59EXod52oKTCTbqoya7UJgkVBCqCkJFELbggnCbTiGG6moA9aYavam_9NaCU0JdkR2VY2118xwAJSVGKtXhdN5Fl4wtOJiZievfzvw-Rr3NCHPTuVM0Rnx2bcHTr2jvP0Teh2UMl9L6AOYAFsrxpzuEJftVvhXjo2oB4rf7fXUEi73bbu_lB6Zb4aY
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Output+sensitive+algorithms+for+covering+many+points&rft.jtitle=Discrete+mathematics+and+theoretical+computer+science&rft.au=Hossein+Ghasemalizadeh&rft.au=Mohammadreza+Razzazi&rft.date=2015-01-01&rft.pub=Discrete+Mathematics+%26+Theoretical+Computer+Science&rft.eissn=1365-8050&rft.volume=17+no.+1&rft.issue=Discrete+Algorithms&rft_id=info:doi/10.46298%2Fdmtcs.2102&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_6230b99b88f142758e87ba083e651aef
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon