AbstractIn this paper we describe a collection of efficient algorithms that deliver approximate solution to the weighted stable set, vertex cover and set packing problems. All algorithms guarantee bounds on the ratio of the heuristic solution to the optimal solution
AbstractWe study the set-cover problem, i.e. given a collection C of subsets of a finite set U, find...
We give an efficient deterministic parallel approximation algorithm for the minimum-weight vertex- a...
In this thesis we present sequential and distributed approximation algorithms for covering problems....
We survey approximation algorithms for some well-known and very natural combinatorial optimization p...
AbstractWe consider two (0, 1)-linear programming formulations of the graph (vertex-) coloring probl...
International audienceWe consider two (0, 1)-linear programming formulations of the graph (vertex-) ...
An approximation result is given, connecting two well known combinatorial problems, the Set Cover an...
AbstractThis paper presents approximation algorithms for two extensions of the set cover problem: a ...
AbstractSome open questions concerning the complexity of approximation algorithms for the Maximum In...
AbstractUsing ideas and results from polynomial time approximation and exact computation we design a...
We consider the Max-Vertex-Cover (MVC) problem, i.e., nd k vertices from an undirected and edge-weig...
Abstract. We study the approximability of the weighted edge-dominating set problem. Although even th...
This paper presents algorithms for five NP-hard problems: the vertex set cover of an undirected grap...
In this paper we study the capacitated vertex cover problem, a generalization of the well-known...
Abstract: We study a generalization of the weighted set covering problem where every element needs t...
AbstractWe study the set-cover problem, i.e. given a collection C of subsets of a finite set U, find...
We give an efficient deterministic parallel approximation algorithm for the minimum-weight vertex- a...
In this thesis we present sequential and distributed approximation algorithms for covering problems....
We survey approximation algorithms for some well-known and very natural combinatorial optimization p...
AbstractWe consider two (0, 1)-linear programming formulations of the graph (vertex-) coloring probl...
International audienceWe consider two (0, 1)-linear programming formulations of the graph (vertex-) ...
An approximation result is given, connecting two well known combinatorial problems, the Set Cover an...
AbstractThis paper presents approximation algorithms for two extensions of the set cover problem: a ...
AbstractSome open questions concerning the complexity of approximation algorithms for the Maximum In...
AbstractUsing ideas and results from polynomial time approximation and exact computation we design a...
We consider the Max-Vertex-Cover (MVC) problem, i.e., nd k vertices from an undirected and edge-weig...
Abstract. We study the approximability of the weighted edge-dominating set problem. Although even th...
This paper presents algorithms for five NP-hard problems: the vertex set cover of an undirected grap...
In this paper we study the capacitated vertex cover problem, a generalization of the well-known...
Abstract: We study a generalization of the weighted set covering problem where every element needs t...
AbstractWe study the set-cover problem, i.e. given a collection C of subsets of a finite set U, find...
We give an efficient deterministic parallel approximation algorithm for the minimum-weight vertex- a...
In this thesis we present sequential and distributed approximation algorithms for covering problems....
DOI
Add to ORKG