69 search results - page 7 / 14 » Improved Approximation Algorithms for Minimum Weight Vertex ... |
179
click to vote
OL
2011
14 years 10 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
122
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
120
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
A normalized, power-weighted averaging filter (NPF) is a very good approximation to the well-know local maximum and minimum filters along the object edges and offers noise reducti...
113
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
128
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...