Results 1  10
of
558,265
An almost O(log k)approximation for kconnected subgraphs
, 2009
"... We consider two cases of the Survivable Network Design (SND) problem: given a complete graph Gn = (V, En) with costs on the edges and connectivity requirements {r(u, v) : u, v ∈ V}, find a minimum cost subgraph G of Gn that contains r(u, v) internally disjoint uvpaths for all u, v ∈ V. Our main res ..."
Abstract

Cited by 22 (11 self)
 Add to MetaCart
at minimum cost the connectivity of a given graph J from k − 1 to k; a ρapproximation for it is used to derive an O(ρ · log k)approximation for kConnected Subgraph. Fakcharoenphol and Laekhanukit showed that kConnectivity Augmentation admits an O(log ν)approximation algorithm, where ν is the number
An O(log k)approximation algorithm for the k minimum spanning tree problem in the plane
 In Proceedings of the 26th Annual ACM Symposium on Theory of Computing
, 1994
"... Given n points in the Euclidean plane, we consider the problem of finding the minimum tree spanning any k points. The problem is NPhard and we give an O(logk)approximation algorithm. 1 Introduction A cable company is permitted to service k cities in a state with n cities. To minimise the cost of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given n points in the Euclidean plane, we consider the problem of finding the minimum tree spanning any k points. The problem is NPhard and we give an O(logk)approximation algorithm. 1 Introduction A cable company is permitted to service k cities in a state with n cities. To minimise the cost
Approximation Algorithms for Directed Steiner Problems
 Journal of Algorithms
, 1998
"... We give the first nontrivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing. For both problems, the best ratios known before our work we ..."
Abstract

Cited by 177 (8 self)
 Add to MetaCart
be achieved in polynomial time for any fixed ffl ? 0. Setting i = log k, we obtain an O(log 2 k) approximation ratio in quasipolynomial time. For the directed generalized Steiner network problem, we give an algorithm that achieves an approximation ratio of O(k 2=3 log 1=3 k), where k is the number
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
LogP: Towards a Realistic Model of Parallel Computation
, 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract

Cited by 562 (15 self)
 Add to MetaCart
development of techniques that yield performance across a range of current and future parallel machines. This paper offers a new parallel machine model, called LogP, that reflects the critical technology trends underlying parallel computers. It is intended to serve as a basis for developing fast, portable
Instancebased learning algorithms
 Machine Learning
, 1991
"... Abstract. Storing and using specific instances improves the performance of several supervised learning algorithms. These include algorithms that learn decision trees, classification rules, and distributed networks. However, no investigation has analyzed algorithms that use only specific instances to ..."
Abstract

Cited by 1359 (18 self)
 Add to MetaCart
Abstract. Storing and using specific instances improves the performance of several supervised learning algorithms. These include algorithms that learn decision trees, classification rules, and distributed networks. However, no investigation has analyzed algorithms that use only specific instances
The Viterbi algorithm
 Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract

Cited by 985 (3 self)
 Add to MetaCart
. A799A804, 1964. [9] T. C. Mo, “Theory of electrodynamics in media in noninertial frames and applications, ” J. Math. Phys., vol. 11, pp. 25892610, 1970.
An O(log 2 k)approximation algorithm for the kvertex connected subgraph problem
 In Proceedings of ACM Symposium on Theory of Computing (STOC
, 2008
"... We present an O(log n·log k)approximation algorithm for the problem of finding kvertex connected spanning subgraph of minimum cost, where n is the number of vertices in the input graph, and k is the connectivity requirement. Our algorithm works for both directed and undirected graphs. The best k ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
algorithm with the algorithm of Kortsarz and Nutov in case of small k, e.g., k < n/2, we have an O(log2 k)approximation algorithm. As in previous work, we use the FrankTardos algorithm for finding koutconnected subgraphs as a subroutine. However, with a structural lemmas that we proved, we are able
A Fast Algorithm for Particle Simulations
, 1987
"... this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions a ..."
Abstract

Cited by 1145 (19 self)
 Add to MetaCart
are Coulombic or gravitational in nature. For a the form system of N particles, an amount of work of the order O(N 2 ) has traditionally been required to evaluate all pairwise interactions, un F5F far 1 (F near 1F external ), less some approximation or truncation method is used. The algorithm of the present
Results 1  10
of
558,265