9176 search results - page 398 / 1836 » algorithms 2010 |
167
click to vote
AAIM
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of fault-tolerance in nanoscale algorithmic self-assembly. We employ t of Winfree's abstract Tile Assembly Model (aTAM), the two-handed aTAM, in which...
146
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
149
click to vote
SCHEDULING
2010
15 years 5 months ago
2010
Abstract We state some of the most important open algorithmic problems in real-time scheduling, and survey progress made on these problems since the 2009 Dagstuhl scheduling semina...