Deterministic sublinear-time approximations for metric 1-median selection

Given oracle access to an n-point metric space (M,d), let metric 1-median be the problem of finding argminx∈M∑y∈Md(x,y), breaking ties arbitrarily. We show that metric 1-median has a deterministic nonadaptive O(n3/2)-time 4-approximation algorithm. ► Metric 1-median asks for a point x in a metric sp...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information processing letters Ročník 113; číslo 8; s. 288 - 292
Hlavný autor: Chang, Ching-Lueh
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 30.04.2013
Elsevier Sequoia S.A
Predmet:
Algorithm
Algorithms
Approximation
Mathematical problems
Median selection
Metric 1-median selection
Metric space
Nonevasive algorithm
Query complexity
Studies
Sublinear-time algorithm
Vector space
Sublinear-time algorithm
Query complexity
Metric space
Metric 1-median selection
Median selection
Nonevasive algorithm
Algorithm
ISSN:0020-0190, 1872-6119
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Given oracle access to an n-point metric space (M,d), let metric 1-median be the problem of finding argminx∈M∑y∈Md(x,y), breaking ties arbitrarily. We show that metric 1-median has a deterministic nonadaptive O(n3/2)-time 4-approximation algorithm. ► Metric 1-median asks for a point x in a metric space (M,d) minimizing ∑y∈Md(x,y). ► This paper shows that metric 1-median has a deterministic nonadaptive O(n3/2)-time 4-approximation algorithm. ► Our result, which concerns deterministic algorithms, is not subsumed by that of Indyk (1999, 2000). ► Our result is not subsumed by those of Guha et al. (2003) because our algorithm is nonadaptive and 4-approximate.
AbstractList Given oracle access to an n-point metric space (M,d), let metric 1-median be the problem of finding ..., breaking ties arbitrarily. We show that metric 1-median has a deterministic nonadaptive O(n3/2)-time 4-approximation algorithm. (ProQuest: ... denotes formulae/symbols omitted.)
Given oracle access to an n-point metric space (M,d), let metric 1-median be the problem of finding argminx∈M∑y∈Md(x,y), breaking ties arbitrarily. We show that metric 1-median has a deterministic nonadaptive O(n3/2)-time 4-approximation algorithm. ► Metric 1-median asks for a point x in a metric space (M,d) minimizing ∑y∈Md(x,y). ► This paper shows that metric 1-median has a deterministic nonadaptive O(n3/2)-time 4-approximation algorithm. ► Our result, which concerns deterministic algorithms, is not subsumed by that of Indyk (1999, 2000). ► Our result is not subsumed by those of Guha et al. (2003) because our algorithm is nonadaptive and 4-approximate.
Author Chang, Ching-Lueh
Author_xml – sequence: 1
  givenname: Ching-Lueh
  surname: Chang
  fullname: Chang, Ching-Lueh
  email: clchang@saturn.yzu.edu.tw
  organization: Department of Computer Science and Engineering, Yuan Ze University, Taoyuan, Taiwan
BookMark eNp9kD1PwzAQhi1UJNrCD2CLxJxw5yRNLCZUvipVYoHZcpyz5Cpf2C6Cf49LmRg63eD38d37LNhsGAdi7BohQ8DV7S6zU5dxwDwDngHkZ2yOdcXTFaKYsTkAhxRQwAVbeL8DgFWRV3O2eaBArreD9cHqxO-bzg6kXBpsT4maJjd-2V4FOw4-MaNLegouBjHtqbVqSDx1pA_Pl-zcqM7T1d9csvenx7f1S7p9fd6s77epznkZUlQFL0XZaKWFAc4RG1FQlSsSLfKqUFSY2ghlyqoWsUfDRcVFo0pTA5i2zZfs5vhvPO1jTz7I3bh3Q1wpMccVCl5WPKaqY0q70XtHRmobfmsEp2wnEeTBm9zJ6E0evEngMu6LJP4jJxcNuO-TzN2RoVj805KTXlsadFTkoh3ZjvYE_QO_8YgC
CODEN IFPLAT
CitedBy_id crossref_primary_10_1016_j_ipl_2013_12_004
crossref_primary_10_1016_j_jcss_2016_08_004
crossref_primary_10_1016_j_ipl_2019_02_007
crossref_primary_10_1145_3563393
crossref_primary_10_1016_j_tcs_2015_07_058
crossref_primary_10_1145_3154858
Cites_doi 10.1137/070698257
10.1007/11523468_70
10.1137/070699007
10.1145/780547.780548
10.1006/jagm.2000.1117
10.1137/S0097539701383443
10.1145/1103963.1103968
10.1145/276698.276718
10.1016/j.socnet.2010.03.006
10.1137/08071990X
10.1007/s10107-004-0524-9
10.1007/s00454-006-1271-x
10.1016/j.comgeo.2004.03.003
10.1016/j.tcs.2011.12.003
10.1016/0378-8733(78)90021-7
10.1137/S0097539701398594
10.1002/rsa.20203
10.1016/j.tcs.2008.10.018
10.7155/jgaa.00081
10.1023/B:MACH.0000033114.18632.e0
10.1006/jcss.2002.1882
10.1137/S0097539797327908
10.1145/301250.301366
10.1145/1824777.1824779
10.1145/375827.375845
10.1007/978-3-642-03685-9_2
10.1137/S0097539703435716
10.1137/S0097539702416402
10.1137/S0097539702404055
10.1086/229694
10.1145/1667053.1667054
10.1137/1.9781611973082.3
10.1109/TKDE.2003.1198387
10.1109/SFFCS.1999.814635
ContentType Journal Article
Copyright 2013 Elsevier B.V.
Copyright Elsevier Sequoia S.A. Apr 30, 2013
Copyright_xml – notice: 2013 Elsevier B.V.
– notice: Copyright Elsevier Sequoia S.A. Apr 30, 2013
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.ipl.2013.02.003
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-6119
EndPage 292
ExternalDocumentID 2915679401
10_1016_j_ipl_2013_02_003
S0020019013000483
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1~.
1~5
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
AAYFN
ABBOA
ABJNI
ABMAC
ABXDB
ABYKQ
ACDAQ
ACGFS
ACRLP
ACZNC
ADBBV
ADEZE
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
AXJTR
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
IHE
J1W
KOM
LG9
M26
M41
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SME
SPC
SPCBC
SSV
SSZ
T5K
TN5
WH7
XPP
ZMT
~G-
1RT
29I
9DU
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABEFU
ABFNM
ABFSI
ABWVN
ACLOT
ACNNM
ACRPL
ACVFH
ADCNI
ADJOM
ADMUD
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
FEDTE
FGOYB
G-2
HLZ
HMJ
HVGLF
HZ~
R2-
SEW
UQL
WUQ
ZY4
~HD
7SC
8FD
AFXIZ
AGCQF
AGRNS
JQ2
L7M
L~C
L~D
SSH
ID FETCH-LOGICAL-c325t-1a42595bcac9f02211b94e73ae9d1274ae4f8f9af5789003b29729ba5f800fdd3
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000316524700009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-0190
IngestDate Fri Jul 25 06:54:48 EDT 2025
Tue Nov 18 20:53:01 EST 2025
Sat Nov 29 07:58:13 EST 2025
Fri Feb 23 02:16:28 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 8
Keywords Sublinear-time algorithm
Query complexity
Metric space
Metric 1-median selection
Median selection
Nonevasive algorithm
Algorithm
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c325t-1a42595bcac9f02211b94e73ae9d1274ae4f8f9af5789003b29729ba5f800fdd3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 1316192572
PQPubID 45522
PageCount 5
ParticipantIDs proquest_journals_1316192572
crossref_citationtrail_10_1016_j_ipl_2013_02_003
crossref_primary_10_1016_j_ipl_2013_02_003
elsevier_sciencedirect_doi_10_1016_j_ipl_2013_02_003
PublicationCentury 2000
PublicationDate 2013-04-30
PublicationDateYYYYMMDD 2013-04-30
PublicationDate_xml – month: 04
  year: 2013
  text: 2013-04-30
  day: 30
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Information processing letters
PublicationYear 2013
Publisher Elsevier B.V
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier Sequoia S.A
References Eppstein, Wang (br0190) 2004; 8
D. Arthur, S. Vassilvitskii
Guha, Meyerson, Mishra, Motwani, OʼCallaghan (br0230) 2003; 15
P. Indyk, Sublinear time algorithms for metric space problems, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 428–434.
S. Arora, P. Raghavan, S. Rao, Approximation schemes for Euclidean
means++: The advantages of careful seeding, in: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 1027–1035.
M. Charikar, L. OʼCallaghan, R. Panigrahy, Better streaming algorithms for clustering problems, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 30–39.
Charikar, Guha (br0110) 2005; 34
Chen (br0140) 2009; 39
Charikar, Guha, Tardos, Shmoys (br0120) 2002; 65
Cohen, Zwick (br0160) 2001; 38
Mahdian, Ye, Zhang (br0320) 2006; 36
Kumar, Sabharwal, Sen (br0300) 2010; 57
Kolliopoulos, Rao (br0290) 2007; 37
medians and related problems, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 106–113.
Freeman (br0200) 1978; 1
Mettu, Plaxton (br0340) 2004; 56
Jain, Vazirani (br0270) 2001; 48
Elkin (br0180) 2005; 1
means on well-clusterable data, in: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, 2011, pp. 26–40.
Baswana, Goyal, Sen (br0070) 2009; 410
P. Indyk, High-dimensional computational geometry, PhD thesis, Stanford University, 2000.
Rudin (br0360) 1976
Goldreich, Ron (br0220) 2008; 32
Kanungo, Mount, Netanyahu, Piatko, Silverman, Wu (br0280) 2004; 28
A. Aggarwal, A. Deshpande, R. Kannan, Adaptive sampling for
M. Bădoiu, A. Czumaj, P. Indyk, C. Sohler, Facility location in sublinear time, in: Proceedings of the 32nd International Conference on Automata, Languages and Programming, 2005, pp. 866–877.
Chudak, Williamson (br0150) 2005; 102
Mettu, Plaxton (br0330) 2003; 32
Wasserman, Faust (br0390) 1994
Chan (br0090) 2010; 39
Lin, Nagarajan, Rajaraman, Williamson (br0310) 2010; 39
Friedkin (br0210) 1991; 96
Arya, Garg, Khandekar, Meyerson, Munagala, Pandit (br0050) 2004; 33
Har-Peled, Kushal (br0240) 2007; 37
Opsahl, Agneessens, Skvoretz (br0350) 2010; 32
means clustering, in: Proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems & the 13th International Workshop on Randomization and Computation, 2009, pp. 15–28.
M. Thorup, Quick and good facility location, in: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 178–185.
V. Braverman, A. Meyerson, R. Ostrovsky, A. Roytman, M. Shindler, B. Tagiku, Streaming
Dor, Halperin, Zwick (br0170) 2000; 29
Chang (br0100) 2012; 426
A. Shoshan, U. Zwick, All pairs shortest paths in undirected graphs with integer weights, in: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 605–614.
Ackermann, Blömer, Sohler (br0010) 2010; 6
Kolliopoulos (10.1016/j.ipl.2013.02.003_br0290) 2007; 37
10.1016/j.ipl.2013.02.003_br0020
Cohen (10.1016/j.ipl.2013.02.003_br0160) 2001; 38
Chudak (10.1016/j.ipl.2013.02.003_br0150) 2005; 102
Freeman (10.1016/j.ipl.2013.02.003_br0200) 1978; 1
Baswana (10.1016/j.ipl.2013.02.003_br0070) 2009; 410
Mettu (10.1016/j.ipl.2013.02.003_br0330) 2003; 32
Charikar (10.1016/j.ipl.2013.02.003_br0120) 2002; 65
Eppstein (10.1016/j.ipl.2013.02.003_br0190) 2004; 8
Chang (10.1016/j.ipl.2013.02.003_br0100) 2012; 426
Mahdian (10.1016/j.ipl.2013.02.003_br0320) 2006; 36
Kanungo (10.1016/j.ipl.2013.02.003_br0280) 2004; 28
Opsahl (10.1016/j.ipl.2013.02.003_br0350) 2010; 32
Wasserman (10.1016/j.ipl.2013.02.003_br0390) 1994
Elkin (10.1016/j.ipl.2013.02.003_br0180) 2005; 1
Har-Peled (10.1016/j.ipl.2013.02.003_br0240) 2007; 37
10.1016/j.ipl.2013.02.003_br0370
Kumar (10.1016/j.ipl.2013.02.003_br0300) 2010; 57
Lin (10.1016/j.ipl.2013.02.003_br0310) 2010; 39
Friedkin (10.1016/j.ipl.2013.02.003_br0210) 1991; 96
10.1016/j.ipl.2013.02.003_br0130
Dor (10.1016/j.ipl.2013.02.003_br0170) 2000; 29
10.1016/j.ipl.2013.02.003_br0030
10.1016/j.ipl.2013.02.003_br0250
Goldreich (10.1016/j.ipl.2013.02.003_br0220) 2008; 32
Charikar (10.1016/j.ipl.2013.02.003_br0110) 2005; 34
Guha (10.1016/j.ipl.2013.02.003_br0230) 2003; 15
Mettu (10.1016/j.ipl.2013.02.003_br0340) 2004; 56
Rudin (10.1016/j.ipl.2013.02.003_br0360) 1976
Ackermann (10.1016/j.ipl.2013.02.003_br0010) 2010; 6
Arya (10.1016/j.ipl.2013.02.003_br0050) 2004; 33
10.1016/j.ipl.2013.02.003_br0080
Jain (10.1016/j.ipl.2013.02.003_br0270) 2001; 48
10.1016/j.ipl.2013.02.003_br0040
10.1016/j.ipl.2013.02.003_br0260
10.1016/j.ipl.2013.02.003_br0380
10.1016/j.ipl.2013.02.003_br0060
Chan (10.1016/j.ipl.2013.02.003_br0090) 2010; 39
Chen (10.1016/j.ipl.2013.02.003_br0140) 2009; 39
References_xml – reference: -means clustering, in: Proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems & the 13th International Workshop on Randomization and Computation, 2009, pp. 15–28.
– volume: 29
  start-page: 1740
  year: 2000
  end-page: 1759
  ident: br0170
  article-title: All pairs almost shortest paths
  publication-title: SIAM Journal on Computing
– volume: 57
  start-page: 5
  year: 2010
  ident: br0300
  article-title: Linear-time approximation schemes for clustering problems in any dimensions
  publication-title: Journal of the ACM
– volume: 32
  start-page: 473
  year: 2008
  end-page: 493
  ident: br0220
  article-title: Approximating average parameters of graphs
  publication-title: Random Structures & Algorithms
– volume: 56
  start-page: 35
  year: 2004
  end-page: 60
  ident: br0340
  article-title: Optimal time bounds for approximate clustering
  publication-title: Machine Learning
– reference: -medians and related problems, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 106–113.
– volume: 34
  start-page: 803
  year: 2005
  end-page: 824
  ident: br0110
  article-title: Improved combinatorial algorithms for facility location problems
  publication-title: SIAM Journal on Computing
– volume: 32
  start-page: 816
  year: 2003
  end-page: 832
  ident: br0330
  article-title: The online median problem
  publication-title: SIAM Journal on Computing
– reference: -means on well-clusterable data, in: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, 2011, pp. 26–40.
– volume: 8
  start-page: 39
  year: 2004
  end-page: 45
  ident: br0190
  article-title: Fast approximation of centrality
  publication-title: Journal of Graph Algorithms and Applications
– reference: D. Arthur, S. Vassilvitskii,
– volume: 28
  start-page: 89
  year: 2004
  end-page: 112
  ident: br0280
  article-title: A local search approximation algorithm for
  publication-title: Computational Geometry
– reference: S. Arora, P. Raghavan, S. Rao, Approximation schemes for Euclidean
– volume: 1
  start-page: 215
  year: 1978
  end-page: 239
  ident: br0200
  article-title: Centrality in social networks: Conceptual clarification
  publication-title: Social Networks
– volume: 39
  start-page: 3633
  year: 2010
  end-page: 3669
  ident: br0310
  article-title: A general approach for incremental approximation and hierarchical clustering
  publication-title: SIAM Journal on Computing
– volume: 1
  start-page: 283
  year: 2005
  end-page: 323
  ident: br0180
  article-title: Computing almost shortest paths
  publication-title: ACM Transactions on Algorithms
– year: 1994
  ident: br0390
  article-title: Social Network Analysis: Methods and Applications
– volume: 37
  start-page: 757
  year: 2007
  end-page: 782
  ident: br0290
  article-title: A nearly linear-time approximation scheme for the Euclidean
  publication-title: SIAM Journal on Computing
– volume: 39
  start-page: 2075
  year: 2010
  end-page: 2089
  ident: br0090
  article-title: More algorithms for all-pairs shortest paths in weighted graphs
  publication-title: SIAM Journal on Computing
– year: 1976
  ident: br0360
  article-title: Principles of Mathematical Analysis
– volume: 15
  start-page: 515
  year: 2003
  end-page: 528
  ident: br0230
  article-title: Clustering data streams: Theory and practice
  publication-title: IEEE Transactions on Knowledge and Data Engineering
– reference: P. Indyk, High-dimensional computational geometry, PhD thesis, Stanford University, 2000.
– reference: M. Charikar, L. OʼCallaghan, R. Panigrahy, Better streaming algorithms for clustering problems, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 30–39.
– volume: 102
  start-page: 207
  year: 2005
  end-page: 222
  ident: br0150
  article-title: Improved approximation algorithms for capacitated facility location problems
  publication-title: Mathematical Programming: Series A and B
– volume: 36
  start-page: 411
  year: 2006
  end-page: 432
  ident: br0320
  article-title: Approximation algorithms for metric facility location problems
  publication-title: SIAM Journal on Computing
– volume: 32
  start-page: 245
  year: 2010
  end-page: 251
  ident: br0350
  article-title: Node centrality in weighted networks: Generalizing degree and shortest paths
  publication-title: Social Networks
– volume: 6
  year: 2010
  ident: br0010
  article-title: Clustering for metric and nonmetric distance measures
  publication-title: ACM Transactions on Algorithms
– reference: M. Bădoiu, A. Czumaj, P. Indyk, C. Sohler, Facility location in sublinear time, in: Proceedings of the 32nd International Conference on Automata, Languages and Programming, 2005, pp. 866–877.
– reference: A. Shoshan, U. Zwick, All pairs shortest paths in undirected graphs with integer weights, in: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 605–614.
– volume: 33
  start-page: 544
  year: 2004
  end-page: 562
  ident: br0050
  article-title: Local search heuristics for
  publication-title: SIAM Journal on Computing
– reference: P. Indyk, Sublinear time algorithms for metric space problems, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 428–434.
– volume: 410
  start-page: 84
  year: 2009
  end-page: 93
  ident: br0070
  article-title: All-pairs nearly 2-approximate shortest paths in
  publication-title: Theoretical Computer Science
– reference: M. Thorup, Quick and good facility location, in: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 178–185.
– reference: A. Aggarwal, A. Deshpande, R. Kannan, Adaptive sampling for
– reference: V. Braverman, A. Meyerson, R. Ostrovsky, A. Roytman, M. Shindler, B. Tagiku, Streaming
– volume: 38
  start-page: 335
  year: 2001
  end-page: 353
  ident: br0160
  article-title: All-pairs small-stretch paths
  publication-title: Journal of Algorithms
– volume: 426
  start-page: 1
  year: 2012
  end-page: 12
  ident: br0100
  article-title: Some results on approximate 1-median selection in metric spaces
  publication-title: Theoretical Computer Science
– volume: 39
  start-page: 923
  year: 2009
  end-page: 947
  ident: br0140
  article-title: On coresets for
  publication-title: SIAM Journal on Computing
– volume: 96
  start-page: 1478
  year: 1991
  end-page: 1504
  ident: br0210
  article-title: Theoretical foundations for centrality measures
  publication-title: The American Journal of Sociology
– reference: -means++: The advantages of careful seeding, in: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 1027–1035.
– volume: 65
  start-page: 129
  year: 2002
  end-page: 149
  ident: br0120
  article-title: A constant-factor approximation algorithm for the
  publication-title: Journal of Computer and System Sciences
– volume: 37
  start-page: 3
  year: 2007
  end-page: 19
  ident: br0240
  article-title: Smaller coresets for
  publication-title: Discrete and Computational Geometry
– volume: 48
  start-page: 274
  year: 2001
  end-page: 296
  ident: br0270
  article-title: Approximation algorithms for metric facility location and
  publication-title: Journal of the ACM
– volume: 39
  start-page: 3633
  issue: 8
  year: 2010
  ident: 10.1016/j.ipl.2013.02.003_br0310
  article-title: A general approach for incremental approximation and hierarchical clustering
  publication-title: SIAM Journal on Computing
  doi: 10.1137/070698257
– ident: 10.1016/j.ipl.2013.02.003_br0060
  doi: 10.1007/11523468_70
– volume: 39
  start-page: 923
  issue: 3
  year: 2009
  ident: 10.1016/j.ipl.2013.02.003_br0140
  article-title: On coresets for k-median and k-means clustering in metric and Euclidean spaces and their applications
  publication-title: SIAM Journal on Computing
  doi: 10.1137/070699007
– ident: 10.1016/j.ipl.2013.02.003_br0130
  doi: 10.1145/780547.780548
– volume: 38
  start-page: 335
  issue: 2
  year: 2001
  ident: 10.1016/j.ipl.2013.02.003_br0160
  article-title: All-pairs small-stretch paths
  publication-title: Journal of Algorithms
  doi: 10.1006/jagm.2000.1117
– volume: 32
  start-page: 816
  issue: 3
  year: 2003
  ident: 10.1016/j.ipl.2013.02.003_br0330
  article-title: The online median problem
  publication-title: SIAM Journal on Computing
  doi: 10.1137/S0097539701383443
– year: 1994
  ident: 10.1016/j.ipl.2013.02.003_br0390
– volume: 1
  start-page: 283
  issue: 2
  year: 2005
  ident: 10.1016/j.ipl.2013.02.003_br0180
  article-title: Computing almost shortest paths
  publication-title: ACM Transactions on Algorithms
  doi: 10.1145/1103963.1103968
– ident: 10.1016/j.ipl.2013.02.003_br0030
  doi: 10.1145/276698.276718
– volume: 32
  start-page: 245
  issue: 3
  year: 2010
  ident: 10.1016/j.ipl.2013.02.003_br0350
  article-title: Node centrality in weighted networks: Generalizing degree and shortest paths
  publication-title: Social Networks
  doi: 10.1016/j.socnet.2010.03.006
– volume: 39
  start-page: 2075
  issue: 5
  year: 2010
  ident: 10.1016/j.ipl.2013.02.003_br0090
  article-title: More algorithms for all-pairs shortest paths in weighted graphs
  publication-title: SIAM Journal on Computing
  doi: 10.1137/08071990X
– ident: 10.1016/j.ipl.2013.02.003_br0040
– volume: 102
  start-page: 207
  issue: 2
  year: 2005
  ident: 10.1016/j.ipl.2013.02.003_br0150
  article-title: Improved approximation algorithms for capacitated facility location problems
  publication-title: Mathematical Programming: Series A and B
  doi: 10.1007/s10107-004-0524-9
– volume: 37
  start-page: 3
  issue: 1
  year: 2007
  ident: 10.1016/j.ipl.2013.02.003_br0240
  article-title: Smaller coresets for k-median and k-means clustering
  publication-title: Discrete and Computational Geometry
  doi: 10.1007/s00454-006-1271-x
– volume: 28
  start-page: 89
  issue: 2–3
  year: 2004
  ident: 10.1016/j.ipl.2013.02.003_br0280
  article-title: A local search approximation algorithm for k-means clustering
  publication-title: Computational Geometry
  doi: 10.1016/j.comgeo.2004.03.003
– ident: 10.1016/j.ipl.2013.02.003_br0380
– volume: 426
  start-page: 1
  year: 2012
  ident: 10.1016/j.ipl.2013.02.003_br0100
  article-title: Some results on approximate 1-median selection in metric spaces
  publication-title: Theoretical Computer Science
  doi: 10.1016/j.tcs.2011.12.003
– volume: 1
  start-page: 215
  issue: 3
  year: 1978
  ident: 10.1016/j.ipl.2013.02.003_br0200
  article-title: Centrality in social networks: Conceptual clarification
  publication-title: Social Networks
  doi: 10.1016/0378-8733(78)90021-7
– volume: 34
  start-page: 803
  issue: 4
  year: 2005
  ident: 10.1016/j.ipl.2013.02.003_br0110
  article-title: Improved combinatorial algorithms for facility location problems
  publication-title: SIAM Journal on Computing
  doi: 10.1137/S0097539701398594
– volume: 32
  start-page: 473
  issue: 4
  year: 2008
  ident: 10.1016/j.ipl.2013.02.003_br0220
  article-title: Approximating average parameters of graphs
  publication-title: Random Structures & Algorithms
  doi: 10.1002/rsa.20203
– volume: 410
  start-page: 84
  issue: 1
  year: 2009
  ident: 10.1016/j.ipl.2013.02.003_br0070
  article-title: All-pairs nearly 2-approximate shortest paths in o(n2polylogn) time
  publication-title: Theoretical Computer Science
  doi: 10.1016/j.tcs.2008.10.018
– volume: 8
  start-page: 39
  issue: 1
  year: 2004
  ident: 10.1016/j.ipl.2013.02.003_br0190
  article-title: Fast approximation of centrality
  publication-title: Journal of Graph Algorithms and Applications
  doi: 10.7155/jgaa.00081
– volume: 56
  start-page: 35
  issue: 1–3
  year: 2004
  ident: 10.1016/j.ipl.2013.02.003_br0340
  article-title: Optimal time bounds for approximate clustering
  publication-title: Machine Learning
  doi: 10.1023/B:MACH.0000033114.18632.e0
– volume: 65
  start-page: 129
  issue: 1
  year: 2002
  ident: 10.1016/j.ipl.2013.02.003_br0120
  article-title: A constant-factor approximation algorithm for the k-median problem
  publication-title: Journal of Computer and System Sciences
  doi: 10.1006/jcss.2002.1882
– volume: 29
  start-page: 1740
  issue: 5
  year: 2000
  ident: 10.1016/j.ipl.2013.02.003_br0170
  article-title: All pairs almost shortest paths
  publication-title: SIAM Journal on Computing
  doi: 10.1137/S0097539797327908
– ident: 10.1016/j.ipl.2013.02.003_br0250
  doi: 10.1145/301250.301366
– volume: 6
  issue: 4
  year: 2010
  ident: 10.1016/j.ipl.2013.02.003_br0010
  article-title: Clustering for metric and nonmetric distance measures
  publication-title: ACM Transactions on Algorithms
  doi: 10.1145/1824777.1824779
– volume: 48
  start-page: 274
  issue: 2
  year: 2001
  ident: 10.1016/j.ipl.2013.02.003_br0270
  article-title: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation
  publication-title: Journal of the ACM
  doi: 10.1145/375827.375845
– ident: 10.1016/j.ipl.2013.02.003_br0020
  doi: 10.1007/978-3-642-03685-9_2
– ident: 10.1016/j.ipl.2013.02.003_br0260
– volume: 36
  start-page: 411
  issue: 2
  year: 2006
  ident: 10.1016/j.ipl.2013.02.003_br0320
  article-title: Approximation algorithms for metric facility location problems
  publication-title: SIAM Journal on Computing
  doi: 10.1137/S0097539703435716
– volume: 33
  start-page: 544
  issue: 3
  year: 2004
  ident: 10.1016/j.ipl.2013.02.003_br0050
  article-title: Local search heuristics for k-median and facility location problems
  publication-title: SIAM Journal on Computing
  doi: 10.1137/S0097539702416402
– volume: 37
  start-page: 757
  issue: 3
  year: 2007
  ident: 10.1016/j.ipl.2013.02.003_br0290
  article-title: A nearly linear-time approximation scheme for the Euclidean k-median problem
  publication-title: SIAM Journal on Computing
  doi: 10.1137/S0097539702404055
– volume: 96
  start-page: 1478
  issue: 6
  year: 1991
  ident: 10.1016/j.ipl.2013.02.003_br0210
  article-title: Theoretical foundations for centrality measures
  publication-title: The American Journal of Sociology
  doi: 10.1086/229694
– volume: 57
  start-page: 5
  issue: 2
  year: 2010
  ident: 10.1016/j.ipl.2013.02.003_br0300
  article-title: Linear-time approximation schemes for clustering problems in any dimensions
  publication-title: Journal of the ACM
  doi: 10.1145/1667053.1667054
– year: 1976
  ident: 10.1016/j.ipl.2013.02.003_br0360
– ident: 10.1016/j.ipl.2013.02.003_br0080
  doi: 10.1137/1.9781611973082.3
– volume: 15
  start-page: 515
  issue: 3
  year: 2003
  ident: 10.1016/j.ipl.2013.02.003_br0230
  article-title: Clustering data streams: Theory and practice
  publication-title: IEEE Transactions on Knowledge and Data Engineering
  doi: 10.1109/TKDE.2003.1198387
– ident: 10.1016/j.ipl.2013.02.003_br0370
  doi: 10.1109/SFFCS.1999.814635
SSID ssj0006437
Score 2.0545619
Snippet Given oracle access to an n-point metric space (M,d), let metric 1-median be the problem of finding argminx∈M∑y∈Md(x,y), breaking ties arbitrarily. We show...
Given oracle access to an n-point metric space (M,d), let metric 1-median be the problem of finding ..., breaking ties arbitrarily. We show that metric...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 288
SubjectTerms Algorithm
Algorithms
Approximation
Mathematical problems
Median selection
Metric 1-median selection
Metric space
Nonevasive algorithm
Query complexity
Studies
Sublinear-time algorithm
Vector space
Title Deterministic sublinear-time approximations for metric 1-median selection
URI https://dx.doi.org/10.1016/j.ipl.2013.02.003
https://www.proquest.com/docview/1316192572
Volume 113
WOSCitedRecordID wos000316524700009&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AIEXJ
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NT9swGLYq2GGXjW1MY8DkA6dVRrGd1PEJIWAaCKEd2NSb5Tjx1qqEihbUn8_r-APaCTQOu0RRlFhJHvv1-_0gtGcyXg1kYYkU1IKBYgakymxGal6yuuaCNR19269zcXFRDofyR693EGth7iaibcvFQk7_K9RwDcB2pbMvgDsNChfgHECHI8AOx38C_jgkuHQdmPsz52Zq4RuJY5H3LcQXo6uQAOdyDK8cp5bpU9IVkbT9WceME-Eax0z3VOXYn_raAudjmHTFQEktP4reZ8fK_Zuc3zZ_HnsVHMNDCpDELH-XsOapPJOk9GWjYUqUj-We5-YLWyjz9HZ_SWfvKBjvj6Yu6EO575bKH7aiGH5f2aFS3mBMSRsrGEK5IVTGVNftdZ2JQoJkXj88PRmepc3YxSV9lo__nBjY7lL8Vt7jKdVkZZPuNI_LDfQmmAz40EP9DvWa9j16G-k4cJDOH9DpEvJ4GXm8jDwGOLFHHkfkcUJ-E_38dnJ59J0EpgxiOCvmhGoQvbKojDbSglZGaSXzRnDdyJoykesmt6WV2hau7hmWJ5NgVFW6sGAvWFiTH9Fae902nxCuNde8MHkNtm6e61xzaQ2jVjoH4cCKLZTFn6RMaCPv2Ewm6klwttDX9MjU91B57uY8_nkVlECv3CmYRc89thNRUmExzhTl1PkHCsE-v-QVttHrhyWxg9bmN7fNLnpl7uaj2c2XMMPuAZDGh5s
linkProvider Elsevier
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=Deterministic+sublinear-time+approximations+for+metric+1-median+selection&rft.jtitle=Information+processing+letters&rft.au=Chang%2C+Ching-Lueh&rft.date=2013-04-30&rft.issn=0020-0190&rft.volume=113&rft.issue=8&rft.spage=288&rft.epage=292&rft_id=info:doi/10.1016%2Fj.ipl.2013.02.003&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ipl_2013_02_003
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon