Solving Generalized Maximum Dispersion with Linear Programming

DOI10.1007/978-3-540-72870-2_1MaRDI QIDQ5434418zbMATH OpenOpenAlexFDO

Authors Gerold Jäger, Anand Srivastav, Katja Wolf

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72870-2_1

zbMATH Keywords

Approximation AlgorithmsRandomized AlgorithmsGeneralized Maximum Dispersion

Mathematics Subject Classification ID

Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for maximum dispersion
• Maximum dispersion problem in dense graphs
• A heuristic for solving the maximum dispersion problem
• Approximation algorithms for dispersion problems
• scientific article; zbMATH DE number 1670536

Cited in

(3)

• Maximum dispersion problem in dense graphs
• Dispersing points on intervals
• Solving the maximum duo-preservation string mapping problem with linear programming

This page was built for publication: Solving Generalized Maximum Dispersion with Linear Programming

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