Sciweavers

105 search results - page 9 / 21
» Almost Optimal Solutions to k-Clustering Problems
Sort
View
HASE
2008
IEEE
15 years 4 months ago
Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks
—In this paper, we investigate the transmission-power assignment problem for k-connected mobile ad hoc networks (MANETs), the problem of optimizing the lifetime of a MANET at a g...
Oliviero Riganelli, Radu Grosu, Samir R. Das, C. R...
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
15 years 10 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
DM
2010
107views more  DM 2010»
14 years 9 months ago
An analytic approach to stability
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, sta...
Oleg Pikhurko
ICSE
2011
IEEE-ACM
14 years 1 months ago
Unifying execution of imperative and declarative code
We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, wri...
Aleksandar Milicevic, Derek Rayside, Kuat Yessenov...
ICALP
2010
Springer
15 years 2 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi