Master-slave strategy and polynomial approximation

DOI10.1023/A:1008764212265MaRDI QIDQ1588828zbMATH OpenOpenAlexFDO

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

Recommendations

• Simultaneous Polynomial Approximation
• Approximation algorithms for discrete polynomial optimization
• Simultaneous approximation of polynomials
• Near minimax polynomial approximation
• On the complexity of master problems
• Mathematical Foundations of Computer Science 2004
• Polynomial time approximation schemes and parameterized complexity
• When polynomial approximation meets exact computation
• When polynomial approximation meets exact computation
• A polynomial approximation scheme for the subset sum problem

Cited in

(6)

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

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

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