3875 search results - page 92 / 775 » Approximation algorithms for the 0-extension problem |
153
click to vote
IPL
2008
15 years 3 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
161
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
164
click to vote
CORR
2012
Springer
14 years 3 days ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
147
click to vote
JSAC
2011
14 years 11 months ago
2011
Abstract— Spectrum management is used to improve performance in multiuser communication system, e.g., cognitive radio or femtocell networks, where multiuser interference can lead...
166
click to vote
WAOA
2010
Springer
15 years 2 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...