Sciweavers

909 search results - page 47 / 182
» On the approximability of some network design problems
Sort
View
ALGOSENSORS
2004
Springer
15 years 7 months ago
Balanced Data Gathering in Energy-Constrained Sensor Networks
We consider the problem of gathering data from a wireless multi-hop network of energy-constrained sensor nodes to a common base station. Specifically, we aim to balance the total...
Emil Falck, Patrik Floréen, Petteri Kaski, ...
CORR
2011
Springer
221views Education» more  CORR 2011»
14 years 8 months ago
Course on System Design (structural approach)
—The article describes a course on system design (structural approach) which involves the following: issues of systems engineering; structural models; basic technological problem...
Mark Sh. Levin
TMC
2010
196views more  TMC 2010»
14 years 12 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
Mahmoud Al-Ayyoub, Himanshu Gupta
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 1 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
EOR
2010
102views more  EOR 2010»
15 years 1 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...