Sciweavers

344 search results - page 63 / 69
» The Directed Minimum Latency Problem
Sort
View
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
15 years 10 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
FSTTCS
2009
Springer
15 years 4 months ago
Kernels for Feedback Arc Set In Tournaments
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
Stéphane Bessy, Fedor V. Fomin, Serge Gaspe...
WSNA
2003
ACM
15 years 2 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
ICALP
2010
Springer
15 years 2 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
BMCBI
2006
152views more  BMCBI 2006»
14 years 9 months ago
A two-stage approach for improved prediction of residue contact maps
Background: Protein topology representations such as residue contact maps are an important intermediate step towards ab initio prediction of protein structure. Although improvemen...
Alessandro Vullo, Ian Walsh, Gianluca Pollastri