ipgmvq/nodeweightedbudget

This package (non-exactly) maximizes the total prize with a budget constraint for an undirected node-weighted rooted graph loosely inspired by Bateni 2018 algorithm from DOI:10.1137/15M102695X

Language: Python - Size: 17.6 KB - Last synced at: 19 days ago - Pushed at: about 2 years ago - Stars: 1 - Forks: 0