432 search results - page 44 / 87 » Minimum Weight Pseudo-Triangulations |
160
click to vote
INFOCOM
2010
IEEE
15 years 4 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...
151
click to vote
APPROX
2010
Springer
15 years 7 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...
134
click to vote
DCC
2001
IEEE
16 years 5 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 ...
198
click to vote
WDAG
2009
Springer
16 years 21 days 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,...
160
click to vote
FUN
2007
Springer
16 years 8 days 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...