1933 search results - page 97 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
168
click to vote
INFOVIS
2003
IEEE
15 years 11 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
179
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
164
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
158
click to vote
ISSAC
1995
Springer
15 years 9 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
151
click to vote
CPC
2006
15 years 6 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...