Sciweavers

1389 search results - page 25 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
14 years 9 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
COCOA
2008
Springer
14 years 11 months ago
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong C...
COMPGEOM
2006
ACM
15 years 3 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
COCOA
2007
Springer
14 years 11 months ago
Improved Approximation Algorithm for Connected Facility Location Problems
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...