简介:Forapairofnodess,tinanundirectedgraphG=(V,A)andagivenlevelUofallowabledelay,wewouldliketomodifythenetworkbynode-basedoredge-basedupgradingstrategiestomakethedelaybetweensandtnotgreaterthanU.Inthispaper,wepresentsomeNP-hardresultsforthedelayimprovementproblems.
Complexity of Reducing the Delay between Two Nodes by Node-based and Edge-based Upgrading Strategies