โ Scribed by J. Zerovnik; T. Pisanski
No coin nor oath required. For personal study only.
The authors wish to thank the anonymous referees for detailed reading of the manuscript. Their comments enabled us to improve the quality of the manuscript considerably, in particular to complete proofs of Lemmas 2 and 5 . We also thank John Shawe-Taylor for careful reading of the final version of the paper.
๐ SIMILAR VOLUMES
Modern networked computing environments and applications often require-or can benefit from-the use of multiple communication substrates, transport mechanisms, and protocols, chosen according to where communication is directed, what is communicated, or when communication is performed. We propose tech
We consider the problem of connecting distinguished terminal pairs in a graph via edge-disjoint paths. This is a classical NP-complete problem for which no general approximation techniques are known; it has recently been brought into focus in papers discussing applications to admission control in hi