Finding Subsets Maximizing Minimum Structures

DOI10.1137/S0895480196309791MaRDI QIDQ4699163zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• scientific article; zbMATH DE number 910870
• Saving an epsilon: a 2-approximation for the k-MST problem in graphs
• scientific article; zbMATH DE number 1003287

Cited in

(6)

• Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
• Maximizing the Number of Nonnegative Subsets
• scientific article; zbMATH DE number 850021 (Why is no real title available?)
• scientific article; zbMATH DE number 910870 (Why is no real title available?)
• Towards Finding Maximal Subrelations with Desired Properties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699163)