scientific article; zbMATH DE number 910870

zbMATH Open0848.68071MaRDI QIDQ4886044FDOQ4886044

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

Publication date: 22 August 1996

Title of this publication is not available (Why is that?)

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

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)

Cited In (7)

• Towards Finding Maximal Subrelations with Desired Properties
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Maximizing the Number of Nonnegative Subsets
• Title not available (Why is that?)
• Facility dispersion and remote subgraphs
• Differential approximation of NP-hard problems with equal size feasible solutions
• 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)