Sciweavers

2354 search results - page 79 / 471
» Assignment Problems
Sort
View
JCSS
2002
199views more  JCSS 2002»
13 years 9 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
INFOCOM
2008
IEEE
14 years 4 months ago
Globally Optimal Channel Assignment for Non-Cooperative Wireless Networks
—Channel assignment is a very important topic in wireless networks. In this paper, we study FDMA channel assignment in a non-cooperative wireless network, where devices are selï¬...
Fan Wu, Sheng Zhong, Chunming Qiao
MONET
2008
77views more  MONET 2008»
13 years 10 months ago
On Relay Node Placement and Assignment for Two-tiered Wireless Networks
Wireless networks that operate on batteries are imposed with energy constraints and long distance communications between nodes are not desirable. Implementing Relay Nodes (RNs) can...
Wenxuan Guo, Xin-Ming Huang, Wenjing Lou, Cao Lian...
ADHOC
2005
122views more  ADHOC 2005»
13 years 10 months ago
Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks
This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we pr...
Hai Liu, Xiaohua Jia, Deying Li, Chan-Hee Lee
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
12 years 9 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák