Skip to content

Optimization of total prize with budget constraint for undirected node-weighted rooted graph

Latest
Latest
Compare
Choose a tag to compare
@ipgmvq ipgmvq released this 03 Apr 05:23
· 2 commits to main since this release
v0.0.2
18e5c11
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Verified
Learn about vigilant mode.

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

Assets 2
Loading