6740 search results - page 270 / 1348 » An s -Hamiltonian Line Graph Problem |
110
Voted
STOC
2006
ACM
15 years 6 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
106
click to vote
WADS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
83
Voted
SIAMCO
2008
15 years 22 days ago
2008
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theore...
103
click to vote
SIAMCOMP
2000
15 years 18 days ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
107
Voted
IAT
2005
IEEE
15 years 6 months ago
2005
IEEE
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...