Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of ...
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...