197 search results - page 26 / 40 » Simple deterministic approximation algorithms for counting m... |
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
SODA
2007
ACM
13 years 9 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
DAM
2010
13 years 7 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
AAAI
2012
11 years 10 months ago
2012
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
ICA
2004
Springer
14 years 1 months ago
2004
Springer
We treat the problem of Blind Deconvolution of Single Input - Single Output (SISO) systems with real or complex binary sources. We explicate the basic mathematical idea by focusing...