AbstractApproximation algorithms may be inevitable choice when it comes to the solution of difficult combinatorial problems. The mathematical analysis of approximation algorithms can lead to various types of results. In this introductory paper, these various possibilities are illustrated on an example taken from scheduling theory
Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms t...
AbstractThis paper presents the main results obtained in the field of approximation algorithms in a ...
In this survey, we give an overview of a technique used to design and analyze algorithms that provi...
Many applications in discrete optimization lead to hard problems. Under common assumption, it is imp...
In this paper we develop an easily applicable algorithmic technique/tool for developing approximatio...
In a combinatorial optimization problem, when given an input instance, one seeks a feasible solution...
In combinatorial optimization, the most important challenges are presented by problems belonging to ...
In this note we discuss some drawbacks of some approaches to the classification of NP-complete optim...
Recently there has been much progress on the design of approximation algorithms for a variety ofsche...
. In the job shop scheduling problem we are given m machines and n jobs; a job consists of a sequenc...
We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time a...
Approximation theory studies the process of approaching arbitrary functions by simple func-tions dep...
Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms t...
AbstractThis paper presents the main results obtained in the field of approximation algorithms in a ...
In this survey, we give an overview of a technique used to design and analyze algorithms that provi...
Many applications in discrete optimization lead to hard problems. Under common assumption, it is imp...
In this paper we develop an easily applicable algorithmic technique/tool for developing approximatio...
In a combinatorial optimization problem, when given an input instance, one seeks a feasible solution...
In combinatorial optimization, the most important challenges are presented by problems belonging to ...
In this note we discuss some drawbacks of some approaches to the classification of NP-complete optim...
Recently there has been much progress on the design of approximation algorithms for a variety ofsche...
. In the job shop scheduling problem we are given m machines and n jobs; a job consists of a sequenc...
We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time a...
Approximation theory studies the process of approaching arbitrary functions by simple func-tions dep...
Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms t...
AbstractThis paper presents the main results obtained in the field of approximation algorithms in a ...
In this survey, we give an overview of a technique used to design and analyze algorithms that provi...
DOI
Add to ORKG