3415 search results - page 241 / 683 » Lower bounds on kernelization |
187
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
208
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
175
Voted
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
168
click to vote
TSP
2008
15 years 6 months ago
2008
In this paper, a novel relaying strategy that uses multiple input multiple output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks...
156
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Recently, applying the novel data mining techniques for evaluating enterprise financial distress has received much research alternation. Support Vector Machine (SVM) and back prop...