841 search results - page 61 / 169 » Approximability of Minimum AND-Circuits |
134
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
129
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
130
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
155
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
145
click to vote
STACS
2001
Springer
15 years 7 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...