986 search results - page 76 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
145
click to vote
INFORMS
2010
15 years 1 months ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
121
Voted
SIROCCO
2004
15 years 4 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
143
click to vote
CPC
2007
15 years 3 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
126
Voted
PODC
2003
ACM
15 years 8 months ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
141
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...