176 search results - page 1 / 36 » Unbalanced Points and Vertices Problem |
88
Voted
PERCOM
2006
ACM
15 years 6 months ago
2006
ACM
100
Voted
ESA
2005
Springer
15 years 6 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
93
Voted
JGAA
2006
15 years 24 days ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
101
Voted
DGCI
2005
Springer
15 years 6 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
113
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...