Sciweavers

CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 4 months ago
The Networked Common Goods Game
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...
Jinsong Tan
IPL
2002
90views more  IPL 2002»
13 years 4 months ago
On the approximability of two tree drawing conventions
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 ...
Paolo Penna
DAM
2006
78views more  DAM 2006»
13 years 4 months ago
Hybrid rounding techniques for knapsack problems
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...
Monaldo Mastrolilli, Marcus Hutter
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 4 months ago
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
AAAI
2008
13 years 6 months ago
Physical Search Problems Applying Economic Search Models
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...
GLOBECOM
2009
IEEE
13 years 7 months ago
Joint Base Station Placement and Fault-Tolerant Routing in Wireless Sensor Networks
—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...
Dejun Yang, Satyajayant Misra, Guoliang Xue
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
13 years 9 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
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,...
COCOON
2005
Springer
13 years 10 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
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
13 years 10 months ago
On strip packing With rotations
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...
Klaus Jansen, Rob van Stee
INFOCOM
2009
IEEE
13 years 11 months ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— 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....
Satyajayant Misra, Guoliang Xue, Dejun Yang