412 search results - page 5 / 83 » Single-Sink Network Design with Vertex Connectivity Requirem... |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Network measurement at 10+Gbps speeds imposes many restrictions on the resource consumption of the measurement application, making any filtering of input data highly desirable...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
MOBIHOC
2012
ACM
11 years 10 months ago
2012
ACM
Mobile devices are increasingly being relied on for services that go beyond simple connectivity and require more complex processing. Fortunately, a mobile device encounters, possi...
DISOPT
2008
13 years 7 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...