1933 search results - page 266 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
145
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
114
Voted
WAIM
2007
Springer
15 years 9 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
117
Voted
MP
2008
15 years 3 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
140
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We present an algorithm for clustering sets of detected
interest points into groups that correspond to visually dis-
tinct structure. Through the use of a suitable colour and tex...
132
click to vote
RECOMB
2008
Springer
16 years 4 months ago
2008
Springer
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...