Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

Clustering categorical distributions in the probability simplex is a fundamental task met in many applications dealing with… Expand

2012

2012

Robustness in Operations Research/Decision Aid is often associated with min–max and min–max regret criteria. This common approach… Expand

Highly Cited

2010

Highly Cited

2010

We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in… Expand

2009

2009

We show that both confined atoms and electron-atom scattering can be described by a unified basis set method. The central idea… Expand

Highly Cited

2008

Highly Cited

2008

Given a set of points [email protected]?R^d and value @e>0, an @[email protected]?P has the property that the smallest ball… Expand

2006

2006

The traditional problems of facility location are defined statically; a set (or multiset) of n points is given as input… Expand

2006

2006

In this paper, an optimal algorithm to solve the continuous/discrete weighted 2-center problem is proposed. The method… Expand

Highly Cited

2005

Highly Cited

2005

This paper discusses dynamical systems for disk-covering and sphere-packing problems. We present facility location functions from… Expand

2005

2005

Consider n sites evolving within a convex polygon according to one of the following interaction laws: (i) each site moves away… Expand

Highly Cited

1983

Highly Cited

1983

We present an O(n(log n)3(log log n)2) algorithm for the problem of finding a point (x, y) in the plane that minimizes the… Expand