Abstract. We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game [12]. We focus on a fairly general sub...
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sar...
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
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...
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....