Balanced paths in acyclic networks: Tractable cases and related approaches
Work
Year: 2005
Type: article
Abstract: Given a weighted acyclic network G and two nodes s and t in G, we consider the problem of computing k balanced paths from s to t, that is, k paths such that the difference in cost between the longest ... more
Source: Networks
Institutions University of Florence, University of Pisa
Cites: 18
Cited by: 12
Related to: 10
FWCI:
Citation percentile (by year/subfield): 73.82
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze