1933 search results - page 69 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
145
Voted
ESA
2009
Springer
15 years 8 months ago
2009
Springer
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
143
click to vote
EACL
2009
ACL Anthology
15 years 1 months ago
2009
ACL Anthology
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
138
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
114
Voted
EPIA
2007
Springer
15 years 9 months ago
2007
Springer
The goal of an Evolutionary Algorithm(EA) is to find the optimal solution to a given problem by evolving a set of initial potential solutions. When the problem is multi-modal, an ...
148
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...