3678 search results - page 83 / 736 » On the Stable Paths Problem |
132
click to vote
FOCS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
96
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
92
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and ...
89
Voted
GBRPR
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
177
Voted
ICDE
2005
IEEE
16 years 2 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...