Improving the complexities of approximation algorithms for optimization problems
type: Item
instance of: scholarly article
title: Improving the complexities of approximation algorithms for optimization problems
zbMATH Open document ID: 0836.90097
DOI: 10.1016/0167-6377(95)91591-Z
author: M. Y. Kovalyov
published in: Operations Research Letters
publication date: 1996-01-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 829727
zbMATH Keywords: approximation scheme
zbMATH Keywords: computational complexities
zbMATH Keywords: single and parallel machine scheduling
MaRDI profile type: Publication
cites work: Fast approximation algorithm for job sequencing with deadlines
cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors
cites work: A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
cites work: Q4124332
cites work: A fully polynomial approximation scheme for the total tardiness problem
cites work: Single Machine Scheduling to Minimize Total Late Work
cites work: Algorithms for Scheduling Independent Tasks
full work available at URL: 0167-6377(95)91591-z
OpenAlex ID: W2068013459
Recommended article: On approximating NP-hard optimization problems
Recommended article: Q4407450
Recommended article: Q4864960
Recommended article: Q4362925
Recommended article: Approximate solution of NP optimization problems
Recommended article: Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
Recommended article: The complexity of approximation reoptimization algorithms for discrete optimization
Recommended article: Complexity of approximating bounded variants of optimization problems
Recommended article: Complexity and approximation in reoptimization
Recommended article: ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
description: scientific article; zbMATH DE number 829727