scientific article; zbMATH DE number 910870

MaRDI QIDQ4886044zbMATH OpenFDO

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

Publication date 22 August 1996

zbMATH Keywords

greedy algorithmremote-MSTremote-STremote-TSP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding Subsets Maximizing Minimum Structures
• The minimum spanning tree problem with non-terminal set
• scientific article; zbMATH DE number 1003287
• A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
• Saving an epsilon: a 2-approximation for the k-MST problem in graphs

Cited in

(8)

• Finding Subsets Maximizing Minimum Structures
• Towards Finding Maximal Subrelations with Desired Properties
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Maximizing the Number of Nonnegative Subsets
• scientific article; zbMATH DE number 850021 (Why is no real title available?)
• Differential approximation of NP-hard problems with equal size feasible solutions
• Facility dispersion and remote subgraphs
• An O(pn^ 2) algorithm for the p-median and related problems on tree graphs

This page was built for publication:

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