Master-slave strategy and polynomial approximation

DOI10.1023/A:1008764212265zbMath1017.90081OpenAlexW1571040502MaRDI QIDQ1588828

Laurent Alfandari, Vangelis Th. Paschos

Publication date: 26 August 2003

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008764212265

zbMATH Keywords

combinatorial optimizationapproximationnetwork designset-covering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (6)

Approximation of the Clustered Set Covering Problem ⋮ Time slot scheduling of compatible jobs ⋮ A note on the clustered set covering problem ⋮ A tutorial on the use of graph coloring for some problems in robotics ⋮ On the probabilistic minimum coloring and minimum \(k\)-coloring ⋮ An approximation algorithm to the \(k\)-Steiner forest problem

This page was built for publication: Master-slave strategy and polynomial approximation