Sciweavers

3875 search results - page 70 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
ISAAC
2001
Springer
99views Algorithms» more  ISAAC 2001»
14 years 1 months ago
Tree-Approximations for the Weighted Cost-Distance Problem
Christian Schindelhauer, Birgitta Weber
ADHOC
2010
292views more  ADHOC 2010»
13 years 9 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»
13 years 8 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
FSTTCS
1999
Springer
14 years 1 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