1424 search results - page 36 / 285 » The Multi-radius Cover Problem |
102
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
79
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
CORR
2007
Springer
15 years 21 days ago
2007
Springer
We suggest a new, unconventional, way for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build a device which can ...
106
click to vote
ALGORITHMICA
2005
15 years 19 days ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
WINE
2009
Springer
15 years 7 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...