432 search results - page 44 / 87 » Minimum Weight Pseudo-Triangulations |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
DCC
2001
IEEE
14 years 7 months ago
2001
IEEE
In this paper, we study binary optimal odd formally self-dual codes. All optimal odd formally self-dual codes are classified for length up to 16. The highest minimum weight of any ...
WDAG
2009
Springer
14 years 2 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
FUN
2007
Springer
14 years 1 months ago
2007
Springer
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...