Master-slave strategy and polynomial approximation
type: Item
instance of: scholarly article
title: Master-slave strategy and polynomial approximation
zbMATH Open document ID: 1017.90081
DOI: 10.1023/A:1008764212265
author: Laurent Alfandari
author: Vangelis Th. Paschos
published in: Computational Optimization and Applications
publication date: 2003-08-26T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1540621
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: approximation
zbMATH Keywords: network design
zbMATH Keywords: set-covering
MaRDI profile type: Publication
full work available at URL: a:1008764212265
OpenAlex ID: W1571040502
Recommended article: Simultaneous Polynomial Approximation
Recommended article: Approximation algorithms for discrete polynomial optimization
Recommended article: Simultaneous Approximation of Polynomials
Recommended article: Near minimax polynomial approximation
Recommended article: On the Complexity of Master Problems
Recommended article: Mathematical Foundations of Computer Science 2004
Recommended article: Polynomial time approximation schemes and parameterized complexity
Recommended article: When polynomial approximation meets exact computation
Recommended article: A polynomial approximation scheme for the subset sum problem
description: scientific article; zbMATH DE number 1540621