scientific article; zbMATH DE number 1670536

MaRDI QIDQ2753733zbMATH OpenFDO

Authors Sándor P. Fekete, Henk Meijer

Publication date 11 November 2001

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 177561
• Facility dispersion and remote subgraphs
• Heuristic and Special Case Algorithms for Dispersion Problems
• Approximation algorithms for maximum dispersion

Cited in

(9)

• Approximation algorithms for maximum dispersion
• Maximum weight relaxed cliques and Russian doll search revisited
• Dispersion with connectivity in wireless mesh networks
• Maximum dispersion and geometric maximum weight cliques
• A linear time approximation scheme for computing geometric maximum \(k\)-star
• scientific article; zbMATH DE number 754942 (Why is no real title available?)
• Solving Generalized Maximum Dispersion with Linear Programming
• Maximum dispersion problem in dense graphs
• On central placements of new vertices in a planar point set

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 Q2753733)