642 search results - page 99 / 129 » Approximation Algorithms for Minimum K-Cut |
118
Voted
APVIS
2008
15 years 4 months ago
2008
by the abstracting, focusing and explanatory qualities of diagram drawing in art, in this paper we propose a novel seeding strategy to generate representative and illustrative str...
107
click to vote
AIPS
2003
15 years 4 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
130
Voted
OPODIS
2004
15 years 4 months ago
2004
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
137
Voted
SIROCCO
2001
15 years 4 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
150
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...