Finding Subsets Maximizing Minimum Structures

DOI10.1137/S0895480196309791zbMath0940.68102OpenAlexW1988500643MaRDI QIDQ4699163

Magnús M. Halldórsson, Takeshi Tokuyama, Kazuo Iwano, Naoki Katoh

Publication date: 23 November 1999

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480196309791

zbMATH Keywords

dispersionminimum spanning treeSteiner treetraveling salesperson tour

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Result diversification by multi-objective evolutionary algorithms with theoretical guarantees ⋮ An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs

This page was built for publication: Finding Subsets Maximizing Minimum Structures