1221 search results - page 101 / 245 » Balanced graph partitioning |
129
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...
119
Voted
GD
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
128
Voted
ACTA
2008
15 years 2 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
150
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
124
Voted
MOBICOM
2006
ACM
15 years 8 months ago
2006
ACM
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...