1941 search results - page 3 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
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 scala...
ENDM
2010
13 years 5 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
INFOCOM
1998
IEEE
13 years 9 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...
SIGMETRICS
2005
ACM
13 years 10 months ago
2005
ACM
This paper considers the basic problem of “how accurate can we make Internet performance measurements”. The answer is somewhat counter-intuitive in that there are bounds on th...
COMBINATORICA
2006
13 years 5 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...