4843 search results - page 419 / 969 » The Shortcut Problem - Complexity and Approximation |
140
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
371
click to vote
COCOON
2011
Springer
14 years 4 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
171
click to vote
TSP
2012
14 years 12 days ago
2012
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
127
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Two new techniques are proposed to improve stereo matching performance in this work. First, to address the disparity discontinuity problem in occluded regions, we present a dispar...
130
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...