Sciweavers

761 search results - page 4 / 153
» Efficient Approximation Algorithms for the Subset-Sums Equal...
Sort
View
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
14 years 1 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
14 years 1 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...
JPDC
2006
148views more  JPDC 2006»
13 years 7 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
SIAMJO
2000
88views more  SIAMJO 2000»
13 years 7 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
TWC
2008
238views more  TWC 2008»
13 years 7 months ago
Downlink resource allocation in multi-carrier systems: frequency-selective vs. equal power allocation
In this paper, a dynamic subcarrier and power allocation problem is considered in the context of asymptotic utility maximization in multi-carrier systems. Using the gradient-based...
Hyang-Won Lee, Song Chong