Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Partition problem

Known as: Number partitioning, Partition, Partitioning problem 
In number theory and computer science, the partition problem (or number partitioning) is the task of deciding whether a given multiset S of positive… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We give a unification of several different speaker recognition problems in terms of the general speaker partitioning problem… Expand
  • table 4
  • table 2
  • table 3
  • table 5
  • table 8
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In this paper, we studied an optimal partition problem for the Dirichlet eigenvalue. We established the existence of classical… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We propose a simple game for modeling containment of the spread of viruses in a graph of n nodes. Each node must choose to either… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering… Expand
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We extend to the case of many competing densities the results of the paper (Ann. Inst. H. Poincare 6 (2002)). More precisely, we… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 7
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The graph partitioning problem is that of dividing the vertices of a graph into sets of specified sizes such that few edges cross… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
In this paper we describe several forms of thek-partition problem and give integer programming formulations of each case. The… Expand
Is this relevant?