59 search results - page 7 / 12 » Minimum Cuts in Near-Linear Time |
WG
2004
Springer
14 years 28 days ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
MP
2006
13 years 7 months ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
ICCSA
2009
Springer
14 years 2 months ago
2009
Springer
Supporting multimedia traffic is one of the major challenges for the next generation of wireless personal area networks (WPANs). Especially, the IEEE 802.15.4 WPAN standards specif...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...