A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem
From MaRDI portal
Publication:920030
DOI10.1007/BF01784988zbMath0707.90082MaRDI QIDQ920030
Cid Carvalho De Souza, Celso Carneiro Ribeiro
Publication date: 1990
Published in: OR Spektrum (Search for Journal in Brave)
05C05: Trees
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
90B80: Discrete location and assignment
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Cites Work