The partition-problem tag has no wiki summary.
5
votes
1answer
129 views
Dividing a weighted planar graph into $k$ subgraphs with balanced weight
I've been looking for an algorithm which divides an undirected, weighted, planar and simple graph into $k$ disjoint subgraphs. Here, the graph is sparse, $k$ is fixed, and there are no negative edge ...
4
votes
0answers
153 views
Fastest known algorithm for 3-Partition problem
3-Partition problem is $\mathsf{NP}$-Complete in a strong sense meaning there is no pseudo-polynomial time algorithm for it unless $\mathsf{P}=\mathsf{NP}$. I'm looking for the fastest known exact ...
