2137 search results - page 65 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
ATMOS
2007
13 years 10 months ago
2007
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
FSTTCS
1993
Springer
14 years 25 days ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
COMGEO
2010
ACM
13 years 8 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...