#### Filter Results:

- Full text PDF available (81)

#### Publication Year

1991

2017

- This year (1)
- Last 5 years (18)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
- J. Algorithms
- 1991

*Department of Computer Science, Tel Aviv University, Tel Aviv, Israel 69978; ‘Department of Electrical Engineetig and Computer Science, Computer Science Division, University of California, Berkeley, CA 94720; ‘Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M6C 3B7; ‘Department of Mathematics and Computer Science, Amherst… (More)

- Samir Khuller, Balaji Raghavachari, Neal E. Young
- SODA
- 1993

Efficient algorithms are known for computing a minimum spann.ing tree, or a shortest path. tree (with a fixed vertex as the root). The weight of a shortest path tree can be much more than the weight of a minimum spa,nning tree. Conversely, the distance bet,ween the root, and any vertex in a minimum spanning tree may be much more than the distance bet#ween… (More)

- Abdullah Mueen, Eamonn J. Keogh, Neal E. Young
- KDD
- 2011

Time series shapelets are small, local patterns in a time series that are highly predictive of a class and are thus very useful features for building classifiers and for certain visualization and summarization tasks. While shapelets were introduced only recently, they have already seen significant adoption and extension in the community. Despite their… (More)

- Samir Khuller, Balaji Raghavachari, Neal E. Young
- Algorithmica
- 1995

We give a simple algorithm to find a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous tradeoff: given the two trees and aγ>0, the algorithm returns a spanning tree in which the distance between any vertex and the root of the shortest-path tree is at most 1+√2γ times the… (More)

- Neal E. Young
- FOCS
- 2001

We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly given problems, our fastest sequential algorithm returns a solution satisfying all constraints within a 1 ± ǫ factor in O(md log(m)/ǫ) time, where m is the number of constraints… (More)

- Neal E. Young
- SODA
- 1995

We introduce a new technique called oblivious rounding a variant of randomized rounding that avoids the bottleneck of first solving the linear program. Avoiding this bottleneck yields more efficient algorithms and brings probabilistic methods to bear on a new class of problems. We give oblivious rounding algorithms that approximately solve general packing… (More)

- Neal E. Young, Robert E. Tarjan, James B. Orlin
- Networks
- 1991

We use Fibonacci heaps to improve a parametric shortest path algorithm of Karp and Orlin, and we combine our algorithm and the method of Schneider and Schneider’s minimum-balance algorithm to obtain a faster minimum-balance algorithm. For a graph with n vertices and m edges, our parametric shortest path algorithm and our minimum-balance algorithm both run… (More)

- Neal E. Young
- Algorithmica
- 1998

Abstract. Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost , maintain a cache of files of total size at most some specified k so as to minimize the total retrieval cost. Specifically, when a requested file is not in the cache, bring it into the cache and pay… (More)

- Samir Khuller, Balaji Raghavachari, Neal E. Young
- SIAM J. Comput.
- 1994

The minimum equivalent graph (MEG) problem is as follows: given a directed graph, find a smallest subset of the edges that maintains all teachability relations between nodes. This problem is NP-hard; this paper gives an approximation algorithm achieving a performance guarantee of about 1.64 in polynomial time. The algorithm achieves a performance guarantee… (More)

- David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
- Math. Oper. Res.
- 1999

Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each terminal from the others. The multiway cut problem is to find a minimum-cost multiway cut. This problem is Max-SNP hard. Recently Calinescu, Karloff, and Rabani (STOC’98) gave a novel… (More)