1162 search results - page 18 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
193
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
196
click to vote
WSCG
2003
15 years 7 months ago
2003
Computer-aided analysis of four-dimensional tomography data has become an important tool in modern cardiology. In order to examine the capability and health of a patient’s cardi...
185
click to vote
WADS
1993
Springer
15 years 10 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
181
click to vote
FOCS
2008
IEEE
16 years 11 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
195
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...