3874 search results - page 150 / 775 » Approximation Algorithms for k-hurdle Problems |
114
click to vote
ADHOCNOW
2004
Springer
15 years 7 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
119
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
132
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
108
click to vote
TCC
2007
Springer
15 years 8 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
130
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...