AbstractThis paper presents principles for the classification of greedy algorithms for optimization problems. These principles are made precise by their expression in the relational calculus, and illustrated by various examples. A discussion compares this work to other greedy algorithms theory
The realization that selfish interests need to be accounted for in the design of algorithms has prod...
AbstractIn this paper we present a new optimization problem and a general class of objective functio...
AbstractThe worst-case analysis of the greedy algorithm for a combinatorial problem of linear maximi...
AbstractThis paper presents principles for the classification of greedy algorithms for optimization ...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
Each chapter comprises a separate study on some optimization problem giving both an introductory loo...
One central question in theoretical computer science is how to solve problems accurately and quickly...
Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes c...
Abstract- This paper presents a survey on Greedy Algorithm. This discussion is centered on overview ...
The event B method provides a general framework for modelling both data structures and algorithms. B...
AbstractThe event B method provides a general framework for modelling both data structures and algor...
There has been little work on how to construct greedy algorithms to solve new optimization problems ...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
We survey some recent developments in the analysis of greedy algorithms for assignment and transport...
International audienceWe will review the recent development of rational approximation in one and sev...
The realization that selfish interests need to be accounted for in the design of algorithms has prod...
AbstractIn this paper we present a new optimization problem and a general class of objective functio...
AbstractThe worst-case analysis of the greedy algorithm for a combinatorial problem of linear maximi...
AbstractThis paper presents principles for the classification of greedy algorithms for optimization ...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
Each chapter comprises a separate study on some optimization problem giving both an introductory loo...
One central question in theoretical computer science is how to solve problems accurately and quickly...
Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes c...
Abstract- This paper presents a survey on Greedy Algorithm. This discussion is centered on overview ...
The event B method provides a general framework for modelling both data structures and algorithms. B...
AbstractThe event B method provides a general framework for modelling both data structures and algor...
There has been little work on how to construct greedy algorithms to solve new optimization problems ...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
We survey some recent developments in the analysis of greedy algorithms for assignment and transport...
International audienceWe will review the recent development of rational approximation in one and sev...
The realization that selfish interests need to be accounted for in the design of algorithms has prod...
AbstractIn this paper we present a new optimization problem and a general class of objective functio...
AbstractThe worst-case analysis of the greedy algorithm for a combinatorial problem of linear maximi...
DOI
Add to ORKG