Results 1  10
of
268
Lower bounds for Howard’s algorithm for finding Minimum MeanCost Cycles
"... Howard’s policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to weighted directed graphs, which may be viewed as Deterministic MDPs (DMDPs), Howard’s algorithm can be used to find Minimum Me ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
MeanCost cycles (MMCC). Experimental studies suggest that Howard’s algorithm works extremely well in this context. The theoretical complexity of Howard’s algorithm for finding MMCCs is a mystery. No polynomial time bound is known on its running time. Prior to this work, there were only linear lower
Smoothed Analysis of the MinimumMean Cycle Canceling Algorithm and the Network Simplex Algorithm
"... The minimumcost flow (MCF) problem is a fundamental optimization problem with many applications and seems to be well understood. Over the last half century many algorithms have been developed to solve the MCF problem and these algorithms have varying worstcase bounds on their running time. Howeve ..."
Abstract
 Add to MetaCart
. On the other hand, the MinimumMean Cycle Canceling (MMCC) algorithm is strongly polynomial, but performs badly in experimental studies. To explain these differences in performance in practice we apply the framework of smoothed analysis. For the number of iterations of the MMCC algorithm we show an upper bound
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
 SIAM Journal on Discrete Mathematics
, 1997
"... We analyze the strong relationship among three combinatorial problems, namely the problem of sorting a permutation by the minimum number of reversals (MINSBR), the problem of finding the maximum number of edgedisjoint alternating cycles in a breakpoint graph associated with a given permutation (MA ..."
Abstract

Cited by 64 (9 self)
 Add to MetaCart
We analyze the strong relationship among three combinatorial problems, namely the problem of sorting a permutation by the minimum number of reversals (MINSBR), the problem of finding the maximum number of edgedisjoint alternating cycles in a breakpoint graph associated with a given permutation
A new algorithm for finding minimal cyclebreaking sets of turns in a graph
 Journal of Graph Algorithms and Applications
, 2006
"... We consider the problem of constructing a minimal cyclebreaking set of turns for a given undirected graph. This problem is important for deadlockfree wormhole routing in computer and communication networks, such as Networks of Workstations. The proposed Cycle Breaking algorithm, or CB algorithm, g ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of the algorithm is O(N∆). We provide lower bounds on the minimum size of cyclebreaking sets for connected graphs. Further, we construct minimal cyclebreaking sets and establish bounds on the minimum fraction of prohibited turns for two important classes of graphs, namely, tpartite graphs and graphs with small
On the Number of Hamiltonian Cycles . . .
"... The main contribution of this paper is a new approach for enumerating Hamilton cycles in bounded degree graphs – deriving thereby extremal bounds. We describe an algorithm which enumerates all Hamilton cycles of a given 3regular nvertex graph in time O(1.276 n), improving on Eppstein’s previous bo ..."
Abstract
 Add to MetaCart
. This result is complemented by a lower bound of 48 n/8 ≥ 1.622 n. Then we present an algorithm which finds the minimum weight Hamilton cycle of a given 4regular graph in time √ 3 n · poly(n) = O(1.733 n), improving a previous result of Eppstein. This algorithm can be modified to compute the number
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up ..."
Abstract
 Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up
Minimum Variance Estimation of a Sparse Vector Within the Linear Gaussian Model: An
"... Abstract — We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian noise. Our analysis is based on the theory of reproducing kernel Hilbert spaces (RKHS). After a characterizat ..."
Abstract
 Add to MetaCart
characterization of the RKHS associated with the SLGM, we derive a lower bound on the minimum variance achievable by estimators with a prescribed bias function, including the important special case of unbiased estimation. This bound is obtained via an orthogonal projection of the prescribed mean function onto a
Finding realvalued singlesource shortest paths in o(n³) expected time
 J. ALGORITHMS
, 1998
"... Given an nvertex, medge directed network G with real costs on the edges and a designated source vertex s, we give a new algorithm to compute shortest paths from s. Our algorithm is a simple deterministic one with O(n² log n) expected running time over a large class of input distributions. This is ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
. This is the first strongly polynomial algorithm in over 35 years to improve upon some aspect of the O(nm) running time of the BellmanFord algorithm. The result extends to an O(n² log n) expected running time algorithm for finding the minimum mean cycle, an improvement over Karp's O(nm) worstcase time bound
Approximating maximum weight cycle covers in directed graphs with weights zero and one
 Algorithmica
, 2005
"... A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A kcycle cover is a cycle cover where each cycle has length at least k. Given a complete directed graph with edge weights zero and one, MaxkDCC(0, 1) is the problem of finding a kcycle cover w ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
cover with minimum weight. We particularly obtain a 2 3 approximation algorithm for the asymmetric maximum traveling salesman problem with distances zero and one and a 4 3 approximation algorithm for the asymmetric minimum traveling salesman problem with distances one and two. As a lower bound, we prove
Results 1  10
of
268