@article{
 title = {Flow problems in multi-interface networks},
 type = {article},
 year = {2014},
 identifiers = {[object Object]},
 keywords = {Multi-interface networks,approximation algorithms,computational complexity,experimental analysis,flow},
 volume = {63},
 id = {4f23e877-6a2e-32c4-aa21-5f0aa19ca39f},
 created = {2018-10-08T12:08:10.124Z},
 file_attached = {false},
 profile_id = {84ce8429-76d1-3854-b705-aea791bb12b7},
 group_id = {f21b0253-3968-3a3c-94e9-8d6f3fa6acf2},
 last_modified = {2018-10-08T12:08:10.235Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {In heterogeneous networks, devices communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available ones, each device might establish several connections. A connection may be established when the devices at its endpoints share at least one active interface. In this paper, we consider two fundamental optimization problems. In the first one (Maximum Flow in Multi-Interface Networks, MFMI), we aim to establish the maximal bandwidth that can be guaranteed between two given nodes of the input network. In the second problem (Minimum-Cost Flow in Multi-Interface Networks, MCFMI), we look for activating the cheapest set of interfaces among a network to guarantee a minimum bandwidth (B) of communication between two specified nodes. We show that MFMI is polynomially solvable while MCFMI is (NP)-hard even for a bounded number of different interfaces and bounded degree networks. Moreover, we provide polynomial approximation algorithms for MCFMI and exact algorithms for relevant subproblems. Finally, we experimentally analyze the proposed approximation algorithm, showing that in practical cases it guarantees a low approximation ratio. © 2014 IEEE.},
 bibtype = {article},
 author = {D'Angelo, G. and Di Stefano, G. and Navarra, A.},
 journal = {IEEE Transactions on Computers},
 number = {2}
}

{"_id":"vw5xNyQbTvLy3MebR","bibbaseid":"dangelo-distefano-navarra-flowproblemsinmultiinterfacenetworks-2014","downloads":0,"creationDate":"2019-03-14T13:06:17.685Z","title":"Flow problems in multi-interface networks","author_short":["D'Angelo, G.","Di Stefano, G.","Navarra, A."],"year":2014,"bibtype":"article","biburl":null,"bibdata":{"title":"Flow problems in multi-interface networks","type":"article","year":"2014","identifiers":"[object Object]","keywords":"Multi-interface networks,approximation algorithms,computational complexity,experimental analysis,flow","volume":"63","id":"4f23e877-6a2e-32c4-aa21-5f0aa19ca39f","created":"2018-10-08T12:08:10.124Z","file_attached":false,"profile_id":"84ce8429-76d1-3854-b705-aea791bb12b7","group_id":"f21b0253-3968-3a3c-94e9-8d6f3fa6acf2","last_modified":"2018-10-08T12:08:10.235Z","read":false,"starred":false,"authored":false,"confirmed":false,"hidden":false,"private_publication":false,"abstract":"In heterogeneous networks, devices communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available ones, each device might establish several connections. A connection may be established when the devices at its endpoints share at least one active interface. In this paper, we consider two fundamental optimization problems. In the first one (Maximum Flow in Multi-Interface Networks, MFMI), we aim to establish the maximal bandwidth that can be guaranteed between two given nodes of the input network. In the second problem (Minimum-Cost Flow in Multi-Interface Networks, MCFMI), we look for activating the cheapest set of interfaces among a network to guarantee a minimum bandwidth (B) of communication between two specified nodes. We show that MFMI is polynomially solvable while MCFMI is (NP)-hard even for a bounded number of different interfaces and bounded degree networks. Moreover, we provide polynomial approximation algorithms for MCFMI and exact algorithms for relevant subproblems. Finally, we experimentally analyze the proposed approximation algorithm, showing that in practical cases it guarantees a low approximation ratio. © 2014 IEEE.","bibtype":"article","author":"D'Angelo, G. and Di Stefano, G. and Navarra, A.","journal":"IEEE Transactions on Computers","number":"2","bibtex":"@article{\n title = {Flow problems in multi-interface networks},\n type = {article},\n year = {2014},\n identifiers = {[object Object]},\n keywords = {Multi-interface networks,approximation algorithms,computational complexity,experimental analysis,flow},\n volume = {63},\n id = {4f23e877-6a2e-32c4-aa21-5f0aa19ca39f},\n created = {2018-10-08T12:08:10.124Z},\n file_attached = {false},\n profile_id = {84ce8429-76d1-3854-b705-aea791bb12b7},\n group_id = {f21b0253-3968-3a3c-94e9-8d6f3fa6acf2},\n last_modified = {2018-10-08T12:08:10.235Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {In heterogeneous networks, devices communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available ones, each device might establish several connections. A connection may be established when the devices at its endpoints share at least one active interface. In this paper, we consider two fundamental optimization problems. In the first one (Maximum Flow in Multi-Interface Networks, MFMI), we aim to establish the maximal bandwidth that can be guaranteed between two given nodes of the input network. In the second problem (Minimum-Cost Flow in Multi-Interface Networks, MCFMI), we look for activating the cheapest set of interfaces among a network to guarantee a minimum bandwidth (B) of communication between two specified nodes. We show that MFMI is polynomially solvable while MCFMI is (NP)-hard even for a bounded number of different interfaces and bounded degree networks. Moreover, we provide polynomial approximation algorithms for MCFMI and exact algorithms for relevant subproblems. Finally, we experimentally analyze the proposed approximation algorithm, showing that in practical cases it guarantees a low approximation ratio. © 2014 IEEE.},\n bibtype = {article},\n author = {D'Angelo, G. and Di Stefano, G. and Navarra, A.},\n journal = {IEEE Transactions on Computers},\n number = {2}\n}","author_short":["D'Angelo, G.","Di Stefano, G.","Navarra, A."],"bibbaseid":"dangelo-distefano-navarra-flowproblemsinmultiinterfacenetworks-2014","role":"author","urls":{},"keyword":["Multi-interface networks","approximation algorithms","computational complexity","experimental analysis","flow"],"downloads":0},"search_terms":["flow","problems","multi","interface","networks","d'angelo","di stefano","navarra"],"keywords":["multi-interface networks","approximation algorithms","computational complexity","experimental analysis","flow"],"authorIDs":[]}