Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/7389

Full metadata record

DC Field	Value	Language
dc.creator	Ramaswamy, Ramkumar	-
dc.creator	Orlin, James	-
dc.creator	Chakravarty, Nilopal	-
dc.date	2004-12-10T19:14:11Z	-
dc.date	2004-12-10T19:14:11Z	-
dc.date	2004-12-10T19:14:11Z	-
dc.date.accessioned	2013-10-09T02:39:46Z	-
dc.date.available	2013-10-09T02:39:46Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/7389	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	This paper addresses sensitivity analysis questions concerning the shortest path problem and the maximum capacity path problem in an undirected network. For both problems, we determine the maximum and minimum weights that each edge can have so that a given path remains optimal. For both problems, we show how to determine these maximum and minimum values for all edges in O(m + K log K) time, where m is the number of edges in the network, and K is the number of edges on the given optimal path.	-
dc.format	504845 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	MIT Sloan School of Management Working Paper;4465-03	-
dc.subject	sensitivity analysis	-
dc.subject	shortest path problem	-
dc.subject	bottleneck shortest path	-
dc.subject	maximum capacity path problem	-
dc.title	Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI