Sciweavers

4843 search results - page 37 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ALMOB
2006
97views more  ALMOB 2006»
13 years 8 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi
SIAMCOMP
2008
123views more  SIAMCOMP 2008»
13 years 8 months ago
Approximation Algorithms for Biclustering Problems
One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) tha...
Lusheng Wang, Yu Lin, Xiaowen Liu
ALGOSENSORS
2009
Springer
14 years 3 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
COCOON
2008
Springer
13 years 10 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
WINE
2010
Springer
189views Economy» more  WINE 2010»
13 years 6 months ago
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swam...