Sciweavers

1389 search results - page 24 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
15 years 4 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
14 years 11 months ago
An improved approximation algorithm for the partial latin square extension problem
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
Carla P. Gomes, Rommel G. Regis, David B. Shmoys
FOCS
2006
IEEE
15 years 3 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
ALGOSENSORS
2009
Springer
15 years 4 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
ISAAC
2009
Springer
103views Algorithms» more  ISAAC 2009»
15 years 4 months ago
An Improved Approximation Algorithm for the Traveling Tournament Problem
Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashir...