983 search results - page 5 / 197 » Negative-Weight Cycle Algorithms |
181
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
160
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
122
click to vote
ARCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a sub-problem, the cyc...
129
click to vote
APLAS
2009
ACM
15 years 11 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
133
click to vote
DATE
2002
IEEE
15 years 10 months ago
2002
IEEE
Although algorithm level re-computing techniques can trade-off the detection capability of Concurrent Error Detection (CED) vs. time overhead, it results in 100% time overhead whe...