W. Fernandez de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani. Polynomial time approximation schemes for metric min-sum clustering. 35th STOC, pp. 50--58, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Approximation Schemes for Clustering Problems (Extended .. - Vega, Karpinski.. (2003) (Correct)
....and the best choice for a cluster center. In the k Center problem, the cost of a clustering is the maximum distance between a point and its cluster center. In the settings that we consider, these optimization problems are NP hard to solve exactly even for k = 2 (using arguments similar to those in [14, 13]) Our results. Our algorithms deal with the case that ffi is an arbitrary metric. We also handle the non metric case of 2 instances , i.e. points in R where the distance between two points x; y is measured by ffi(x; y) kx Gamma yk 2 . For the metric and for the 2 k Clustering ....
W. Fernandez de la Vega, M. Karpinski, and C. Kenyon. A polynomial time approximation scheme for metric MIN-BISECTION. ECCC TR02-041, 2002.
Frequency-Based Views to Pattern Collections - Mielikäinen (2003) (Correct)
....to be discretized: the frequency and the accuracy of the rule. This can be generalized for patterns with d dimensional vectors of interestingness values. The problem is equivalent to clustering. Thus in general, the problem is NP hard, but the approximation algorithms for clustering can be applied [10, 19, 17]. 4 Condensation with Discretization Discretization can be used to simplify the collection of the frequent patterns. The high level schema is the following: 1. Discretize the frequencies of the frequent patterns. 2. Find a condensed representation for the collection of the frequent patterns with ....
W. F. de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani, Polynomial time approximation schemes for metric min-sum clustering, Tech. Rep. 25, Electronic Colloquium on Computational COmplexity, 2002.
Approximation Schemes for Clustering Problems in.. - Vega, Karpinski.. (2002) Self-citation (De la Karpinski Kenyon) (Correct)
No context found.
W. Fernandez de la Vega, M. Karpinski, and C. Kenyon. A polynomial time approximation scheme for metric MIN-BISECTION. ECCC TR02-041, 2002.
A Polynomial Time Approximation Scheme for Subdense MAX-CUT - Vega, Karpinski (2002) (2 citations) Self-citation (De la Karpinski) (Correct)
No context found.
W. Fernandez de la Vega, M. Karpinski, and C. Kenyon, A Polynomial Time Approximation Scheme for Metric MIN-BISECTION, ECCC, Technical Report TR02-025, 2002.
On Approximability of Minimum Bisection Problem - Karpinski (2002) Self-citation (Karpinski) (Correct)
No context found.
W. Fernandez de la Vega, M. Karpinski and C. Kenyon, Polynomial Time Approximation Scheme for Metric MIN-BISECTION, ECCC Technical Report, TR02-041, 2002.
Polynomial Time Approximation Schemes for Metric.. - Vega, Karpinski.. (2002) (2 citations) Self-citation (De la Karpinski Kenyon) (Correct)
No context found.
W. Fernandez de la Vega, M. Karpinski, and C. Kenyon. A polynomial time approximation scheme for metric MIN-BISECTION. Manuscript, 2002.
A Polynomial Time Approximation Scheme for Subdense MAX-CUT - Vega, Karpinski (2002) (2 citations) Self-citation (De la Karpinski) (Correct)
No context found.
W. Fernandez de la Vega, M. Karpinski, and C. Kenyon, A Polynomial Time Approximation Scheme for Metric MIN-BISECTION, ECCC, Technical Report TR02-025, 2002.
Polynomial Time Approximation Schemes for Metric.. - Vega, Karpinski.. (2002) (2 citations) Self-citation (De la Karpinski Kenyon) (Correct)
No context found.
W. Fernandez de la Vega, M. Karpinski, and C. Kenyon. A polynomial time approximation scheme for metric MIN-BISECTION. Manuscript, 2002.
Approximability of the Minimum Bisection Problem: An Algorithmic .. - Karpinski (2002) Self-citation (Karpinski) (Correct)
No context found.
W. Fernandez de la Vega, M. Karpinski and C. Kenyon, Polynomial Time Approximation Scheme for Metric MIN-BISECTION, Manuscript, 2002.
Sublinear-Time Approximation for Clustering via - Random Sampling Artur (Correct)
No context found.
W. Fernandez de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani. Polynomial time approximation schemes for metric min-sum clustering. 35th STOC, pp. 50--58, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC