Sciweavers

144 search results - page 20 / 29
» A Polynomial Time Approximation Scheme for the Square Packin...
Sort
View
PODC
2009
ACM
14 years 8 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
JUCS
2010
142views more  JUCS 2010»
13 years 6 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
14 years 23 days ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...
DAM
2007
107views more  DAM 2007»
13 years 7 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
COCOON
2005
Springer
14 years 1 months ago
Interval Subset Sum and Uniform-Price Auction Clearing
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
Anshul Kothari, Subhash Suri, Yunhong Zhou