Minimum rectilinear Steiner tree of n points in the unit square

被引：1

作者：

Dumitrescu, Adrian ^{[1
]}

Jiang, Minghui ^{[2
]}

机构：

[1] Univ Wisconsin, Dept Comp Sci, Milwaukee, WI 53201 USA

[2] Utah State Univ, Dept Comp Sci, Logan, UT 84322 USA

来源：

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2018年 / 68卷

关键词：

Minimum rectilinear Steiner tree; Integer partition; Packing; Covering; HEURISTIC ALGORITHMS; DISTANCE;

D O I：

10.1016/j.comgeo.2017.06.007

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Chung and Graham conjectured (in 1981) that n points in the unit square [0,1](2) can be connected by a rectilinear Steiner tree of length at most root n + 1. Here we confirm this conjecture for small values of n, and for some new infinite sequences of values of n (but not for all n). As an interesting byproduct we obtain close rational approximations of root n from below, for those n. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：253 / 261

页数：9

共 50 条

[31] Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points
Liu, Suding
OPTIMIZATION LETTERS, 2024, 18 (06) : 1421 - 1435
[32] Approximations for Steiner Trees with Minimum Number of Steiner Points
DONGHUI CHEN
DING-ZHU DU
XIAO-DONG HU
GUO-HUI LIN
LUSHENG WANG
GUOLIANG XUE
Journal of Global Optimization, 2000, 18 : 17 - 33
[33] Approximations for Steiner trees with minimum number of Steiner points
Chen, DH
Du, DZ
Hu, XD
Lin, GH
Wang, LS
Xue, GL
THEORETICAL COMPUTER SCIENCE, 2001, 262 (1-2) : 83 - 99
[34] Approximations for Steiner trees with minimum number of Steiner points
Chen, DG
Du, DZ
Hu, XD
Lin, GH
Wang, LS
Xue, GL
JOURNAL OF GLOBAL OPTIMIZATION, 2000, 18 (01) : 17 - 33
[35] Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
Fomin, Fedor, V
Lokshtanov, Daniel
Kolay, Sudeshna
Panolan, Fahad
Saurabh, Saket
ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (02)
[36] GPU-Accelerated Rectilinear Steiner Tree Generation
Guo, Zizheng
Gu, Feng
Lin, Yibo
2022 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, ICCAD, 2022,
[37] Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
U. Fößmeier
M. Kaufmann
A. Zelikovsky
Discrete & Computational Geometry, 1997, 18 : 93 - 109
[38] RECTILINEAR STEINER TREE CONSTRUCTION BY LOCAL AND GLOBAL REFINEMENT
CHAO, TH
HSU, YC
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1994, 13 (03) : 303 - 309
[39] A scalable and accurate rectilinear Steiner minimal tree algorithm
Wong, Yiu-Chung
Chu, Chris
2008 INTERNATIONAL SYMPOSIUM ON VLSI DESIGN, AUTOMATION AND TEST (VLSI-DAT), PROCEEDINGS OF TECHNICAL PROGRAM, 2008, : 29 - +
[40] Faster approximation algorithms for the rectilinear Steiner tree problem
Fossmeier, U
Kaufmann, M
Zelikovsky, A
DISCRETE & COMPUTATIONAL GEOMETRY, 1997, 18 (01) : 93 - 109

← 1 2 3 4 5 →