Results 1  10
of
9,510
Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems
, 1997
"... We present a randomized polynomial time approximation scheme for Euclidean TSP in ! 2 that is substantially more efficient than our earlier scheme in [2] (and the scheme of Mitchell [21]). For any fixed c ? 1 and any set of n nodes in the plane, the new scheme finds a (1+ 1 c )approximation to ..."
Abstract

Cited by 93 (3 self)
 Add to MetaCart
use our ideas to design nearlylinear time approximation schemes for Euclidean vers...
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
 In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS’96
, 1996
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c � 1 and given any n nodes in � 2, a randomized version of the scheme finds a (1 � 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes a ..."
Abstract

Cited by 399 (3 self)
 Add to MetaCart
to Christofides) achieves a 3/2approximation in polynomial time. We also give similar approximation schemes for some other NPhard Euclidean problems: Minimum Steiner Tree, kTSP, and kMST. (The running times of the algorithm for kTSP and kMST involve an additional multiplicative factor k.) The previous best
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
A linear time approximation scheme for Euclidean TSP
"... Abstract—The Traveling Salesman Problem (TSP) is among the most famous NPhard optimization problems. The special case of TSP in boundeddimensional Euclidean spaces has been a particular focus of research: The celebrated results of Arora [Aro98] and Mitchell [Mit99] – along with subsequent improve ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
improvements of Rao and Smith [RS98] – demonstrated a polynomial time approximation scheme for this problem, ultimately achieving a runtime of Od,ε(n log n). In this paper, we present a linear time approximation scheme for Euclidean TSP, with runtime Od,ε(n). This improvement resolves a 15 year old conjecture
Polynomial Time Approximation Schemes for Euclidean TSP and other GeometricProblems
"... present a polynomial time approximation scheme forEuclidean TSP in!2. Given any n nodes in the planeand ffl? 0, the scheme finds a (1 + ffl)approximationto the optimum traveling salesman tour in time nO(1=ffl).When the nodes are in! d, the running time increases to n ~O(log d\Gamma 2 n)=ffld\Gamma ..."
Abstract
 Add to MetaCart
)=ffld\Gamma 1. The previous best approximation algorithm for the problem (due to Christofides) achieves a 3=2approximation in polynomial time. We also give similar approximation schemes for a hostof other Euclidean problems, including Steiner Tree, kTSP, Minimum degreek spanning tree, kMST, etc. (This list
Network Time Protocol (Version 3) Specification, Implementation and Analysis
, 1992
"... Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings are not ava ..."
Abstract

Cited by 522 (18 self)
 Add to MetaCart
Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings
Approximation schemes for Euclidean kMedians And Related Problems
 In Proc. 30th Annu. ACM Sympos. Theory Comput
, 1998
"... In the kmedian problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances from each of the points of S to the nearest median is minimized. This paper gives an approximation scheme for the plane that ..."
Abstract

Cited by 142 (3 self)
 Add to MetaCart
that for any c > 0 produces a solution of cost at most 1 + 1/c times the optimum and runs in time O(n O(c+1) ). The approximation scheme also generalizes to some problems related to kmedian. Our methodology is to extend Arora's [1, 2] techniques for the TSP, which hitherto seemed inapplicable
TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems
 IN PROCEEDINGS OF THE 1994 WINTER USENIX CONFERENCE
, 1994
"... TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation5000/240's that are connected by a 100Mbps switchbased ATM LAN and a 10Mbps Ethernet. Ou ..."
Abstract

Cited by 527 (17 self)
 Add to MetaCart
. Our objective is to determine the efficiency of a userlevel DSM implementation on commercially available workstations and operating systems. We achieved good speedups on the 8processor ATM network for Jacobi (7.4), TSP (7.2), Quicksort (6.3), and ILINK (5.7). For a slightly modified version
Quantile Regression
 JOURNAL OF ECONOMIC PERSPECTIVES—VOLUME 15, NUMBER 4—FALL 2001—PAGES 143–156
, 2001
"... We say that a student scores at the fifth quantile of a standardized exam if he performs better than the proportion � of the reference group of students and worse than the proportion (1–�). Thus, half of students perform better than the median student and half perform worse. Similarly, the quartiles ..."
Abstract

Cited by 937 (10 self)
 Add to MetaCart
of 166 firms, we compute the three quartiles of CEO compensation: salary, bonus and other compensation, including stock options (as valued by the BlackScholes formula at the time of the grant). For each group, the bowtielike box represents the middle half of the salary distribution lying between
Results 1  10
of
9,510