1424 search results - page 87 / 285 » The Multi-radius Cover Problem |
140
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
123
Voted
COCO
2004
Springer
15 years 4 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
163
click to vote
SIGECOM
2011
ACM
14 years 4 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
110
Voted
MP
2007
15 years 19 days ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
144
Voted
FOSSACS
2009
Springer
15 years 8 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...