4894 search results - page 485 / 979 » The Guarding Problem - Complexity and Approximation |
153
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
144
Voted
FOCS
2007
IEEE
15 years 11 months 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...
135
click to vote
PERCOM
2006
ACM
16 years 4 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...
152
click to vote
BICOB
2009
Springer
15 years 11 months 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...
125
Voted
WG
2009
Springer
15 years 11 months 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...