n-ellipses and the minimum distance sum problem

被引：18
|
作者：
Sekino, J [1 ]
机构：
[1] Willamette Univ, Salem, OR 97301 USA
来源：
AMERICAN MATHEMATICAL MONTHLY | 1999年 / 106卷 / 03期
关键词：
D O I：
10.2307/2589675
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
[No abstract available]
引用
收藏
页码：193 / 202
页数：10
相关论文
共 50 条
  • [1] Certified approximation algorithms for the fermat point and n-ellipses
    Faculty of Informatics, Università della Svizzera Italiana, Lugano, Switzerland
    不详
    Leibniz Int. Proc. Informatics, LIPIcs, 1868,
  • [2] On the location of the minimum point in the Euclidean distance sum problem
    Mello, Luis Fernando
    dos Santos, Lucas Ruiz
    SAO PAULO JOURNAL OF MATHEMATICAL SCIENCES, 2018, 12 (01): : 108 - 120
  • [3] On eccentric distance sum and minimum degree
    Mukungunugwa, Vivian
    Mukwembi, Simon
    DISCRETE APPLIED MATHEMATICS, 2014, 175 : 55 - 61
  • [4] Inverse minimum flow problem under the weighted sum-type Hamming distance
    Liu, Longcheng
    Zheng, Wenhao
    Li, Chao
    DISCRETE APPLIED MATHEMATICS, 2017, 229 : 101 - 112
  • [5] MINIMUM MISS DISTANCE PROBLEM
    BRIDGLAN.TF
    HINKEL, JS
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1967, 18 (03) : 457 - +
  • [6] MINIMUM COVERING ELLIPSES
    SILVERMAN, BW
    TITTERINGTON, DM
    SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1980, 1 (04): : 401 - 409
  • [7] Gradient flows for the minimum distance to the sum of adjoint orbits
    Liu, Xuhua
    Tam, Tin-Yau
    LINEAR & MULTILINEAR ALGEBRA, 2013, 61 (05): : 678 - 696
  • [8] A memetic algorithm for the Minimum Sum Coloring Problem
    Jin, Yan
    Hao, Jin-Kao
    Hamiez, Jean-Philippe
    COMPUTERS & OPERATIONS RESEARCH, 2014, 43 : 318 - 327
  • [9] On the minimum risk-sum path problem
    Chen, Xujin
    Hu, Jie
    Hu, Xiaodong
    COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 175 - +
  • [10] Algorithms for the minimum sum coloring problem: a review
    Yan Jin
    Jean-Philippe Hamiez
    Jin-Kao Hao
    Artificial Intelligence Review, 2017, 47 : 367 - 394
12345