26 search results - page 4 / 6 » Deterministic Edge Weights in Increasing Tree Families |
119
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
113
click to vote
PG
2002
IEEE
15 years 6 months ago
2002
IEEE
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
CPAIOR
2009
Springer
15 years 8 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
112
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
107
click to vote
ICPR
2000
IEEE
16 years 2 months ago
2000
IEEE
We consider di usion processes on a class of R trees. The processes are de ned in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real value...