1158 search results - page 36 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
150
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
235
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
147
click to vote
ICC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
157
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
106
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...