80 search results - page 7 / 16 » A simple local 3-approximation algorithm for vertex cover |
96
Voted
LATIN
2004
Springer
15 years 5 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
113
Voted
FSKD
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
116
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
123
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
88
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...