The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...