Complexity of approximation algorithms for combinatorial problems: a survey

Authors:
Georgii Gens;Evgenii Levner
Affiliations:
Central Economic and Mathematical Institute, Academy of Sciences of the USSR, Moscow;Central Economic and Mathematical Institute, Academy of Sciences of the USSR, Moscow
Venue:
ACM SIGACT News
Year:
1980

Online Knapsack Problems with Limited Cuts

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
There is no EPTAS for two-dimensional knapsack

Information Processing Letters
Online removable knapsack with limited cuts

Theoretical Computer Science
2D knapsack: packing squares

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Online minimization knapsack problem

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
2D knapsack: Packing squares

Theoretical Computer Science

Hi-index	0.00

In this survey we examine recent results on the complexity of approximation algorithms which have appeared in Russian.