Sciweavers

176 search results - page 1 / 36
» Unbalanced Points and Vertices Problem
Sort
View
68
Voted
PERCOM
2006
ACM
15 years 3 months ago
Unbalanced Points and Vertices Problem
Zvi Lotker, Alfredo Navarra
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 2 months ago
Unbalanced Graph Cuts
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...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
JGAA
2006
108views more  JGAA 2006»
14 years 9 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
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...
Sergio Cabello
DGCI
2005
Springer
15 years 2 months ago
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points
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...
Fajie Li, Reinhard Klette
86
Voted
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
15 years 1 months ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
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...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...