9 search results - page 1 / 2 » An Algorithm for Minimum Cost Arc-Connectivity Orientations |
ALGORITHMICA
2010
13 years 7 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
AAIM
2008
Springer
14 years 1 months ago
2008
Springer
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
ADHOCNOW
2009
Springer
13 years 5 months ago
2009
Springer
Broadcasting is a commonly used feature in wireless networking, e.g. for file distribution, re-tasking, event notification, or miscellaneous maintenance. Due to the limited resourc...
IEEESCC
2005
IEEE
14 years 1 months ago
2005
IEEE
The emerging paradigms of service oriented architectures and utility-based computing have the potential to greatly reduce the cost of data management. Data management service prov...
DAM
1999
13 years 7 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...