Sciweavers

599 search results - page 34 / 120
» Approximation Algorithms for Dominating Set in Disk Graphs
Sort
View
JPDC
2007
138views more  JPDC 2007»
13 years 7 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
COCOA
2008
Springer
13 years 9 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...
INFOCOM
2007
IEEE
14 years 2 months ago
A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks
— Broadcast protocols play a vital role in multihop wireless networks. Due to the broadcast nature of radio signals, a node’s interference range can be larger than its transmis...
Zhenming Chen, Chunming Qiao, Jinhui Xu, Taekkyeun...
TIT
2010
103views Education» more  TIT 2010»
13 years 2 months ago
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...