Results 11  20
of
105
Solving Various Weighted Matching Problems with Constraints
, 1997
"... This paper studies the resolution of (augmented) weighted matching problems within a constraint programming framework. The first contribution of the paper is a set of branchandbound techniques that improves substantially the performance of algorithms based on constraint propagation and the second ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
This paper studies the resolution of (augmented) weighted matching problems within a constraint programming framework. The first contribution of the paper is a set of branchandbound techniques that improves substantially the performance of algorithms based on constraint propagation and the second contribution is the introduction of weighted matching as a global constraint (MinWeightAllDifferent), that can be propagated using specialized incremental algorithms from Operations Research. We first compare programming techniques that use constraint propagation with specialized algorithms from Operations Research, such as the Busaker and Gowen flow algorithm or the Hungarian method. Although CLP is shown not to be competitive with specialized polynomial algorithms for "pure" matching problems, the situation is different as soon as the problems are modified with additional constraints. Using the previously mentioned set of techniques, a simpler branchandbound algorithm based on constraint ...
An Efficient Cost Scaling Algorithm for the Assignment Problem
 MATH. PROGRAM
, 1995
"... The cost scaling pushrelabel method has been shown to be efficient for solving minimumcost flow problems. In this paper we apply the method to the assignment problem and investigate implementations of the method that take advantage of assignment's special structure. The results show that the metho ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
The cost scaling pushrelabel method has been shown to be efficient for solving minimumcost flow problems. In this paper we apply the method to the assignment problem and investigate implementations of the method that take advantage of assignment's special structure. The results show that the method is very promising for practical use.
Fast comparison of evolutionary trees
 In Proceedings of the 5th Annual ACMSIAM Symposium on Discrete Algorithms
, 1994
"... ABSTRACT Constructing evolutionary trees for species sets is a fundamental problem in biology. Unfortunately, there is no single agreed upon method for this task, and many methods are in use. Current practice dictates that trees be constructed using different methods and that the resulting trees the ..."
Abstract

Cited by 33 (5 self)
 Add to MetaCart
ABSTRACT Constructing evolutionary trees for species sets is a fundamental problem in biology. Unfortunately, there is no single agreed upon method for this task, and many methods are in use. Current practice dictates that trees be constructed using different methods and that the resulting trees then be compared for consensus. It has become necessary to automate this process as the number of species under consideration has grown. We study the Unrooted Maximum Agreement Subtree Problem (UMAST) and its rooted variant (RMAST).
Greedy matchings
"... Suppose that each member of a set of n applicants ranks a subset of a set of m posts in strict order of preference. A matching is a set of (post, applicant) pairs such that each applicant and each post appears in at most one pair. A greedy matching is one in which the maximum possible number of appl ..."
Abstract

Cited by 32 (10 self)
 Add to MetaCart
Suppose that each member of a set of n applicants ranks a subset of a set of m posts in strict order of preference. A matching is a set of (post, applicant) pairs such that each applicant and each post appears in at most one pair. A greedy matching is one in which the maximum possible number of applicants are matched to their rst choice post, and subject to that condition, the maximum possible number are matched to their second choice post, and so on. This is a relevant concept in any practical matching situation where the preferences are on only one side of the market. A greedy matching can be found by a transformation to the classical problem of maximum weight bipartite matching. However an exponentially decreasing sequence of weights must be assigned to the entries in each preference list, and this adversely a ects the complexity of the algorithm (and its performance in practice). Here, we describe a
Understanding Retiming through Maximum AverageDelay Cycles
 Mathematical Systems Theory
, 1994
"... A synchronous circuit built of functional elements and registers is a simple implementation of the semisystolic model of computation that can be used to design parallel algorithms. Retiming is a wellknown technique that transforms a given circuit into a faster circuit by relocating its registers. W ..."
Abstract

Cited by 31 (8 self)
 Add to MetaCart
A synchronous circuit built of functional elements and registers is a simple implementation of the semisystolic model of computation that can be used to design parallel algorithms. Retiming is a wellknown technique that transforms a given circuit into a faster circuit by relocating its registers. We give tight bounds on the minimum clock period that can be achieved by retiming a synchronous circuit. These bounds are expressed in terms of the maximum delaytoregister ratio of the cycles in the circuit graph and the maximum propagation delay d max of the circuit components. Our bounds do not depend on the size of the circuit, and they are of theoretical as well as practical interest. They characterize exactly the minimum clock period that can be achieved by retiming a unitdelay circuit, and they lead to more efficient algorithms for several important problems related to retiming. Specifically, we give an O(V 1=2 E lg V ) algorithm for minimum clock period retiming of unitdelay circu...
DUAL COORDINATE STEP METHODS FOR LINEAR NETWORK FLOW PROBLEMS
, 1988
"... We review a class of recentlyproposed linearcost network flow methods which are amenable to distributed implementation. All the methods in the class use the notion of ecomplementary slackness, and most do not explicitly manipulate any "global " objects such as paths, trees, or cuts. Interestingly ..."
Abstract

Cited by 31 (8 self)
 Add to MetaCart
We review a class of recentlyproposed linearcost network flow methods which are amenable to distributed implementation. All the methods in the class use the notion of ecomplementary slackness, and most do not explicitly manipulate any "global " objects such as paths, trees, or cuts. Interestingly, these methods have stimulated a large number of new serial computational complexity results. We develop the basic theory of these methods and present two specific methods, the erelaxation algorithm for the minimumcost flow problem, and the auction algorithm for the assignment problem. We show how to implement these methods with serial complexities of O(N 3 log NC) and O(NA log NC), respectively. We also discuss practical implementation issues and computational experience to date. Finally, we show how to implement erelaxation in a completely asynchronous, "chaotic" environment in which some processors compute faster than others, some processors communicate faster than others, and there can be arbitrarily large communication delays.
A Polynomial Time Method for Optimal Software Pipelining
 In Proc. of the Conf. on Vector and Parallel Processing, CONPAR92, number 634 in Lec. Notes in Comp. Sci
, 1992
"... Software pipelining is one of the most important loop scheduling methods used by parallelizing compilers. It determines a static parallel schedule  a periodic pattern  to overlap instructions of a loop body from different iterations. The main contributions of this paper are the following: First, ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
Software pipelining is one of the most important loop scheduling methods used by parallelizing compilers. It determines a static parallel schedule  a periodic pattern  to overlap instructions of a loop body from different iterations. The main contributions of this paper are the following: First, we propose to express the finegrain loop scheduling problem (in particular, software pipelining) on the basis of the mathematical formulation of rperiodic scheduling. This formulation overcomes some of the problems encountered by existing software pipelining methods. Second, we demonstrate the feasibility of the proposed method by (1) presenting a polynomial time algorithm to find an optimal schedule in this rperiodic form that maximizes the computation rate (in fact, we show that this schedule maximizes the computation rate theoretically possible), and by (2) establishing polynomial bounds for the optimal schedule, i.e. bounds on its period, its periodicity, the pattern size, and the c...
A New Approach to AllPairs Shortest Paths on RealWeighted Graphs
 Theoretical Computer Science
, 2003
"... We present a new allpairs shortest path algorithm that works with realweighted graphs in the traditional comparisonaddition model. It runs in O(mn+n time, improving on the longstanding bound of O(mn + n log n) derived from an implementation of Dijkstra's algorithm with Fibonacci heaps. Her ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
We present a new allpairs shortest path algorithm that works with realweighted graphs in the traditional comparisonaddition model. It runs in O(mn+n time, improving on the longstanding bound of O(mn + n log n) derived from an implementation of Dijkstra's algorithm with Fibonacci heaps. Here m and n are the number of edges and vertices, respectively.
Approximation Algorithms for Bipartite and NonBipartite Matching in the Plane
 In SODA: ACMSIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms
, 1999
"... In the approximate Euclidean mincost perfect matching problem, we are a given a set V of 2n points in the plane, and a real number " ? 0, and we want to pair up the points (into n pairs) so that the sum of the distances between the paired points is within a multiplicative factor of (1 + ") of the ..."
Abstract

Cited by 27 (6 self)
 Add to MetaCart
In the approximate Euclidean mincost perfect matching problem, we are a given a set V of 2n points in the plane, and a real number " ? 0, and we want to pair up the points (into n pairs) so that the sum of the distances between the paired points is within a multiplicative factor of (1 + ") of the optimal. We present a MonteCarlo algorithm that returns, with probability at least 1=2, a solution within (1 + ") of the optimal; the running time of our algorithm is O((n=" 3 ) log 6 n). In the bipartite version of this problem, we are given a set R of n red points, a set B of n blue points in the plane, and a real number " ? 0. We want to match each red point with a blue point so that the sum of the distances between paired points is within (1 + ") times that of an optimal matching. We present an algorithm for this problem that runs in O((n=") 3=2 log 5 n) time. 1 Introduction In the approximate (Euclidean) mincost matching problem, we are given a set V of 2n points in the pl...
Finding MinimumCost Flows by Double Scaling
 MATHEMATICAL PROGRAMMING
, 1992
"... Several researchers have recently developed new techniques that give fast algorithms for the minimumcost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nm log log U log(nC)) time on networks with n vertices, m arcs, maximum arc capacity U, and ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
Several researchers have recently developed new techniques that give fast algorithms for the minimumcost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nm log log U log(nC)) time on networks with n vertices, m arcs, maximum arc capacity U, and maximum arc cost magnitude C. The major techniques used are the capacityscaling approach of Edmonds and Karp, the excessscaling approach of Ahuja and Orlin, the costscaling approach of Goldberg and Tarjan, and the dynamic tree data structure of Sleator and Taijan. For nonsparse graphs with large maximum arc capacity, we obtain a similar but slightly better bound. We also obtain a slightly better bound for the (uncapacitated) transportation problem. In addition, we discuss a capacitybounding approach to the