Results 11  20
of
24,966
Polylogarithmic approximation algorithms for Directed Vehicle Routing Problems
 Proc. of APPROX
, 2007
"... Abstract. This paper studies vehicle routing problems on asymmetric metrics. Our starting point is the directed kTSP problem: given an asymmetric metric (V, d), a root r ∈ V and a target k ≤ V , compute the minimum length tour that contains r and at least k other vertices. We present a polynomial ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
Abstract. This paper studies vehicle routing problems on asymmetric metrics. Our starting point is the directed kTSP problem: given an asymmetric metric (V, d), a root r ∈ V and a target k ≤ V , compute the minimum length tour that contains r and at least k other vertices. We present a
ALADDIN project).
, 2010
"... Abstract This paper studies vehicle routing problems on asymmetric metrics. Our starting point is the directed kTSP problem: given an asymmetric metric (V, d), a root r ∈ V and a target k ≤ V , compute the minimum length tour that contains r and at least k other vertices. We present a polynomial ..."
Abstract
 Add to MetaCart
Abstract This paper studies vehicle routing problems on asymmetric metrics. Our starting point is the directed kTSP problem: given an asymmetric metric (V, d), a root r ∈ V and a target k ≤ V , compute the minimum length tour that contains r and at least k other vertices. We present a polynomial
The ant colony optimization metaheuristic
 in New Ideas in Optimization
, 1999
"... Ant algorithms are multiagent systems in which the behavior of each single agent, called artificial ant or ant for short in the following, is inspired by the behavior of real ants. Ant algorithms are one of the most successful examples of swarm intelligent systems [3], and have been applied to many ..."
Abstract

Cited by 385 (23 self)
 Add to MetaCart
to many types of problems, ranging from the classical traveling salesman
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 376 (9 self)
 Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size
Concentration Of Measure And Isoperimetric Inequalities In Product Spaces
, 1995
"... . The concentration of measure phenomenon in product spaces roughly states that, if a set A in a product# N of probability spaces has measure at least one half, "most" of the points of# N are "close" to A. We proceed to a systematic exploration of this phenomenon. The meaning ..."
Abstract

Cited by 383 (4 self)
 Add to MetaCart
. The concentration of measure phenomenon in product spaces roughly states that, if a set A in a product# N of probability spaces has measure at least one half, "most" of the points of# N are "close" to A. We proceed to a systematic exploration of this phenomenon. The meaning of the word "most" is made rigorous by isoperimetrictype inequalities that bound the measure of the exceptional sets. The meaning of the work "close" is defined in three main ways, each of them giving rise to related, but di#erent inequalities. The inequalities are all proved through a common scheme of proof. Remarkably, this simple approach not only yields qualitatively optimal results, but, in many cases, captures near optimal numerical constants. A large number of applications are given, in particular to Percolation, Geometric Probability, Probability in Banach Spaces, to demonstrate in concrete situations the extremely wide range of application of the abstract tools. AMS Classification numbers: Primary 60E15, 28A35, 60G99; Secondary 60G15, 68C15. Typeset by A M ST E X 1 2 M. TALAGRAND Table of Contents I.
A Graduated Assignment Algorithm for Graph Matching
, 1996
"... A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated nonconvexity, twoway (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational comp ..."
Abstract

Cited by 378 (16 self)
 Add to MetaCart
A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated nonconvexity, twoway (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational complexity [O(lm), where l and m are the number of links in the two graphs] and robustness in the presence of noise offer advantages over traditional combinatorial approaches. The algorithm, not restricted to any special class of graph, is applied to subgraph isomorphism, weighted graph matching, and attributed relational graph matching. To illustrate the performance of the algorithm, attributed relational graphs derived from objects are matched. Then, results from twentyfive thousand experiments conducted on 100 node random graphs of varying types (graphs with only zeroone links, weighted graphs, and graphs with node attributes and multiple link types) are reported. No comparable results have...
Inference in Linear Time Series Models with Some Unit Roots," Econometrica
, 1990
"... This paper considers estimation and hypothesis testing in linear time series models when some or all of the variables have unit roots. Our motivating example is a vector autoregression with some unit roots in the companion matrix, which might include polynomials in time as regressors. In the general ..."
Abstract

Cited by 376 (12 self)
 Add to MetaCart
This paper considers estimation and hypothesis testing in linear time series models when some or all of the variables have unit roots. Our motivating example is a vector autoregression with some unit roots in the companion matrix, which might include polynomials in time as regressors. In the general formulation, the variable might be integrated or cointegrated of arbitrary orders, and might have drifts as well. We show that parameters that can be written as coefficients on mean zero, nonintegrated regressors have jointly normal asymptotic distributions, converging at the rate T'/2. In general, the other coefficients (including the coefficients on polynomials in time) will have nonnormal asymptotic distributions. The results provide a formal characterization of which t or F testssuch as Granger causality testswill be asymptotically valid, and which will have nonstandard limiting distributions.
Faster geometric kpoint MST approximation
, 1995
"... We give fast new approximation algorithms for the problem of choosing k planar points out of n to minimize the length of their minimum spanning tree (equivalently, of their traveling salesman tour or Steiner tree). For any x # k, we can find an approximation achieving approximation ratio O(log ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
problem: given n points in the Euclidean plane, find the shortest tree spanning k of the points. Up to constant factors in the approximation ratio, the kMST problem is be equivalent to asking for a path connecting k points (the kTSP problem) or a Steiner tree connecting k points. The choice of Euclidean
The Integration of Functions into Logic Programming: From Theory to Practice
 Journal of Logic Programming
, 1994
"... Abstract. Functional logic programming languages combine the most important declarative programming paradigms, and attempts to combine these paradigms have a long history. The declarative multiparadigm language Curry is influenced by recent advances in the foundations and implementation of function ..."
Abstract

Cited by 362 (59 self)
 Add to MetaCart
Abstract. Functional logic programming languages combine the most important declarative programming paradigms, and attempts to combine these paradigms have a long history. The declarative multiparadigm language Curry is influenced by recent advances in the foundations and implementation of functional logic languages. The development of Curry is an international initiative intended to provide a common platform for the research, teaching, and application of integrated functional logic languages. This paper surveys the foundations of functional logic programming that are relevant for Curry, the main features of Curry, and extensions and applications of Curry and functional logic programming. 1
Results 11  20
of
24,966