334 search results - page 18 / 67 » Inapproximability of Survivable Networks |
132
click to vote
SENSYS
2010
ACM
14 years 9 months ago
2010
ACM
Frequency overlap across wireless networks with different radio technologies can cause severe interference and reduce communication reliability. The circumstances are particularly...
DISOPT
2008
14 years 12 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
ISCC
2005
IEEE
15 years 5 months ago
2005
IEEE
The volume of higher priority Internet applications is increasing as the Internet continues to evolve. Customers require Quality of Service (QoS) guarantees with not only guarante...
ISCC
2002
IEEE
15 years 4 months ago
2002
IEEE
—In this paper we consider the problem of routing the lightpaths of a logical topology of a WDM network on an arbitrary physical topology, such that the logical topology remains ...
101
click to vote
ENDM
2010
14 years 12 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...