4843 search results - page 474 / 969 » The Shortcut Problem - Complexity and Approximation |
166
Voted
FOCS
2007
IEEE
16 years 17 days ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
159
click to vote
PERCOM
2006
ACM
16 years 5 months ago
2006
ACM
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
168
click to vote
BICOB
2009
Springer
16 years 25 days ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
143
Voted
WG
2009
Springer
16 years 25 days ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
150
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...