Sciweavers

3874 search results - page 102 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 4 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
ADHOC
2010
292views more  ADHOC 2010»
14 years 10 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
MP
1998
73views more  MP 1998»
14 years 9 months ago
On proving existence of feasible points in equality constrained optimization problems
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
R. Baker Kearfott
ATAL
2007
Springer
15 years 4 months ago
Constraint satisfaction algorithms for graphical games
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
Vishal Soni, Satinder P. Singh, Michael P. Wellman
FSTTCS
1999
Springer
15 years 2 months ago
A Randomized Algorithm for Flow Shop Scheduling
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
Naveen Garg, Sachin Jain, Chaitanya Swamy