Linear time algorithms for approximating the facility terminal cover problem

DOI10.1002/NET.20172MaRDI QIDQ3593378zbMATH OpenOpenAlexWikidataFDO

Authors Guang Xu, Yang Yang, Jinhui Xu

Publication date 20 July 2007

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20172

zbMATH Keywords

graph theoryalgorithmapproximation algorithmvertex cover

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• The multi‐integer set cover and the facility terminal cover problem
• Improved approximation algorithms for minimum power covering problems
• Improved approximation algorithms for minimum power covering problems
• Improved algorithms for fault tolerant facility location
• scientific article; zbMATH DE number 2119748

Cites work

• scientific article; zbMATH DE number 2038708 (Why is no real title available?)
• scientific article; zbMATH DE number 2119748 (Why is no real title available?)
• Algorithms - ESA 2003
• Automata, Languages and Programming
• Expander flows, geometric embeddings and graph partitioning
• The importance of being biased

Cited in

(2)

• Further contributions to network optimization
• The multi‐integer set cover and the facility terminal cover problem

This page was built for publication: Linear time algorithms for approximating the facility terminal cover problem

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