Results 1  10
of
34
Computing MinimumWeight Perfect Matchings
 INFORMS
, 1999
"... We make several observations on the implementation of Edmonds’ blossom algorithm for solving minimumweight perfectmatching problems and we present computational results for geometric problem instances ranging in size from 1,000 nodes up to 5,000,000 nodes. A key feature in our implementation is the ..."
Abstract

Cited by 94 (2 self)
 Add to MetaCart
We make several observations on the implementation of Edmonds’ blossom algorithm for solving minimumweight perfectmatching problems and we present computational results for geometric problem instances ranging in size from 1,000 nodes up to 5,000,000 nodes. A key feature in our implementation is the use of multiple search trees with an individual dualchange � for each tree. As a benchmark of the algorithm’s performance, solving a 100,000node geometric instance on a 200 Mhz PentiumPro computer takes approximately 3 minutes.
Complexity of computing optimal Stackelberg strategies in security resource allocation games
 In Proceedings of the National Conference on Artificial Intelligence (AAAI
, 2010
"... Recently, algorithms for computing gametheoretic solutions have been deployed in realworld security applications, such as the placement of checkpoints and canine units at Los Angeles International Airport. These algorithms assume that the defender (security personnel) can commit to a mixed strateg ..."
Abstract

Cited by 68 (11 self)
 Add to MetaCart
Recently, algorithms for computing gametheoretic solutions have been deployed in realworld security applications, such as the placement of checkpoints and canine units at Los Angeles International Airport. These algorithms assume that the defender (security personnel) can commit to a mixed strategy, a socalled Stackelberg model. As pointed out by Kiekintveld et al. (Kiekintveld et al. 2009), in these applications, generally, multiple resources need to be assigned to multiple targets, resulting in an exponential number of pure strategies for the defender. In this paper, we study how to compute optimal Stackelberg strategies in such games, showing that this can be done in polynomial time in some cases, and is NPhard in others.
Reducing Randomness Via Irrational Numbers
 In Proceedings of the TwentyNinth Annual ACM Symposium on Theory of Computing
, 1997
"... . We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In contrast to the classical technique of DeMillo, Lipton, Schwart ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
. We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In contrast to the classical technique of DeMillo, Lipton, Schwartz, and Zippel, this methodology can decrease the error probability by increasing the precision of the approximations instead of using more random bits. Consequently, randomized algorithms that use the classical technique can generally be improved using the new methodology. To demonstrate the methodology, we discuss two nontrivial applications. The first is to decide whether a graph has a perfect matching in parallel. Our new NC algorithm uses fewer random bits while doing less work than the previously best NC algorithm by Chari, Rohatgi, and Srinivasan. The second application is to test the equality of two multisets of integers. Our new algorithm improves upon the previously best algorithms ...
A Linear Time Approximation Algorithm for Weighted Matchings in Graphs
, 2003
"... Approximation algorithms have so far mainly been studied for problems that are not known to have polynomial time algorithms for solving them exactly. Here we propose an approximation algorithm for the weighted matching problem in graphs which can be solved in polynomial time. The weighted matching p ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
(Show Context)
Approximation algorithms have so far mainly been studied for problems that are not known to have polynomial time algorithms for solving them exactly. Here we propose an approximation algorithm for the weighted matching problem in graphs which can be solved in polynomial time. The weighted matching problem is to find a matching in an edge weighted graph that has maximum weight. The first polynomial time algorithm for this problem was given by Edmonds in 1965. The fastest known algorithm for the weighted matching problem has a running time of O(nm+n 2 log n). Many real world problems require graphs of such large size that this running time is too costly. Therefore there is considerable need for faster approximation algorithms for the weighted matching problem. We present a linear time approximation algorithm for the weighted matching problem with a performance ratio arbitrarily close to 2/3
A PolynomialTime Fragment of Dominance Constraints
, 2000
"... Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general
A lineartime approximation algorithm for weighted matchings in graphs
 ACM TRANSACTIONS ON ALGORITHMS
, 2005
"... Approximation algorithms have so far mainly been studied for problems that are not known to have polynomial time algorithms for solving them exactly. Here we propose an approximation algorithm for the weighted matching problem in graphs which can be solved in polynomial time. The weighted matching p ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Approximation algorithms have so far mainly been studied for problems that are not known to have polynomial time algorithms for solving them exactly. Here we propose an approximation algorithm for the weighted matching problem in graphs which can be solved in polynomial time. The weighted matching problem is to find a matching in an edge weighted graph that has maximum weight. The first polynomialtime algorithm for this problem was given by Edmonds in 1965. The fastest known algorithm for the weighted matching problem has a running time of O(nm + n² log n). Many real world problems require graphs of such large size that this running time is too costly. Therefore, there is considerable need for faster approximation algorithms for the weighted matching problem. We present a lineartime approximation algorithm for the weighted matching problem with a performance ratio arbitrarily close to 2/1. This improves the previously best performance ratio of 3/2. Our algorithm is not only of theoretical interest, but because it is easy to implement and the constants involved are quite small it is also useful in practice.
Engineering algorithms for approximate weighted matching
 In Proceedings of the 6th International Workshop on Experimental Algorithms
, 2007
"... Abstract. We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a recent path heuristic. Surprisingly, this quite simple algorithm performs very well, both in terms of running time ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a recent path heuristic. Surprisingly, this quite simple algorithm performs very well, both in terms of running time and solution quality, and, though some other methods have a better theoretical performance, it ranks among the best algorithms. 1
On Sum Coloring of Graphs
, 2000
"... The sum coloring problem asks to find a vertex coloring of a given graph G, using natural numbers, such that the total sum of the colors of vertices is minimized amongst all proper vertex colorings of G. This minimum total sum is the chromatic sum of the graph, \Sigma(G), and a coloring which achiev ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
The sum coloring problem asks to find a vertex coloring of a given graph G, using natural numbers, such that the total sum of the colors of vertices is minimized amongst all proper vertex colorings of G. This minimum total sum is the chromatic sum of the graph, \Sigma(G), and a coloring which achieves this total sum is called an optimum coloring. There are some graphs for which the optimum coloring needs more colors than indicated by the chromatic number. The minimum number of colors needed in any optimum coloring of a graph is called the strength of the graph, which we denote by s(G). Trivially (G) s(G). In this thesis we present various results about the sum coloring problem. We prove the NPHardness of finding the vertex strength for graphs with \Delta = 6 and also give some logarithmic upper bounds for the vertex strength of graphs with small chromatic number. We also prove that the sum coloring problem is NPcomplete for split graphs. Polynomial time algorithms are presented for the sum coloring of ksplit graphs, P 4 reducible graphs, chain bipartite graphs, and cobipartite graphs. We can