Research ArticleOpen AccessGoogle Scholar indexed
The Antimedian Function on Paths
Department of Mathematics, Harold Washington College, Chicago, IL, USA
Department of Mathematics, Harold Washington College, Chicago, IL, USA
- 1 Department of Mathematics, Harold Washington College, Chicago, IL, USA
- 2 Department of Mathematics, Harold Washington College, Chicago, IL, USA
Open Journal of Discrete Mathematics·Volume 04 (2014)·Pages 77–88·Published 26 June 2014·DOI10.4236/ojdm.2014.43011
Copy link · social · email
Abstract
An antimedian of a sequence of elements of a finite metric space is an element for which is a maximum. The function with domain the set of all finite sequences on , and defined by { : is an antimedian of } is called the antimedian function on . In this note, the antimedian function on finite paths is axiomatically characterized.
KeywordsStatusLocation FunctionAntimedianAntimedian Function
- Church, R.L. and Garinkel, R.S. (1978) Locating an Obnoxious Facility on a Network. Transportation Science, 12, 107-118. http://dx.doi.org/10.1287/trsc.12.2.107
- Minieka, E. (1983) Anti-Centers and Anti-Medians of a Network. Networks, 13, 359-365. http://dx.doi.org/10.1002/net.1027
- Ting, S.S. (1984) A Linear-Time Algorithm for Maxisum Facility Location on Tree Networks. Transportation Science, 18, 76-84. http://dx.doi.org/10.1287/trsc.18.1.76
- Zelinka, B. (1968) Medians and Peripherians of Trees. Archiv der Mathematik, 4, 87-95.
- Burkard, R.E., Dollani, H., Lin, Y. and Rote, G. (2001) The Obnoxious Center Problem on a Tree. SIAM Journal on Discrete Mathematics, 14, 498-509. http://dx.doi.org/10.1137/S0895480198340967
- Drezner, Z. and Wesolowsky, G.O. (1985) Location of Multiple Obnoxious Facilities. Transportation Science, 19, 193-202. http://dx.doi.org/10.1287/trsc.19.3.193
- Labbé, M. (1990) Location of an Obnoxious Facility on a Network: A Voting Approach. Networks, 20, 197-207. http://dx.doi.org/10.1002/net.3230200206
- Holzman, R. (1990) An Axiomatic Approach to Location on Networks. Mathematics of Operations Research, 15, 553-563.
- Vohra, R. (1996) An Axiomatic Characterization of Some Location in Trees. European Journal of Operational Research, 90, 78-84. http://dx.doi.org/10.1016/0377-2217(94)00330-0
- Foster, D.P. and Vohra, R. (1998) An Axiomatic Characterization of a Class of Location in Tree Networks. Operational Research, 46, 347-354. http://dx.doi.org/10.1287/opre.46.3.347
- Barthélemy, J.P. and McMorris, F.R. (1986) The Median Procedure for N-Trees. Journal of Classification, 3, 329-334. http://dx.doi.org/10.1007/BF01894194
- Barthélemy, J.P. and Monjardet, B. (1981) The Median Procedure in Cluster Analysis and Social Choice Theory. Mathematical Social Sciences, 1, 235-268. http://dx.doi.org/10.1016/0165-4896(81)90041-X
- Kriston, G. and Ortega, O. (2013) The Median Function on Trees. Discrete Mathematics, Algorithms and Applications, 4.
- McMorris, F.R., Mulder, H.M. and Ortega, O. (2010) Axiomatic Characterization of the Mean Function on Trees. Discrete Mathematics, Algorithms and Applications, 2, 313-329.
- McMorris, F.R., Mulder, H.M. and Ortega, O. (2012) The lp-Function on Trees. Networks, 60, 94-102.