144 search results - page 20 / 29 » Unit disk graph approximation |
110
Voted
ESA
2005
Springer
15 years 7 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...
138
click to vote
ALGORITHMICA
1998
15 years 1 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
137
click to vote
NETWORKS
2002
15 years 1 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
122
click to vote
FCT
2007
Springer
15 years 6 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
107
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...