350 search results - page 52 / 70 » Lower bounds and heuristic algorithms for the k |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
ICMLA
2007
14 years 11 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
INFOCOM
1998
IEEE
15 years 1 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
105
click to vote
ALGORITHMICA
2008
14 years 9 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
81
Voted
COR
2010
14 years 9 months ago
2010
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...