We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
— Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternative...
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...