Sciweavers

45 search results - page 9 / 9
» Improved approximation algorithms for minimum AND-circuits p...
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 4 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
WINE
2009
Springer
93views Economy» more  WINE 2009»
13 years 11 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
GLOBECOM
2010
IEEE
13 years 2 months ago
Relay Station Placement for Cooperative Communications in WiMAX Networks
The recently emerging WiMAX (IEEE 802.16) is a promising telecommunication technology to provide low-cost, high-speed and long-range wireless communications. To meet the growing de...
Dejun Yang, Xi Fang, Guoliang Xue, Jian Tang
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 10 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust