Rigid Network Design Via Submodular Set Function Optimization

2015 ◽  
Vol 2 (3) ◽  
pp. 84-96 ◽  
Author(s):  
Iman Shames ◽  
Tyler H. Summers
2020 ◽  
Vol 40 (1) ◽  
pp. 36-44 ◽  
Author(s):  
Xiang Li ◽  
H. George Du ◽  
Panos M. Pardalos

2021 ◽  
Author(s):  
◽  
Susan Jowett

<p>A connectivity function is a symmetric, submodular set function. Connectivity functions arise naturally from graphs, matroids and other structures. This thesis focuses mainly on recognition problems for connectivity functions, that is when a connectivity function comes from a particular type of structure. In particular we give a method for identifying when a connectivity function comes from a graph, which uses no more than a polynomial number of evaluations of the connectivity function. We also give a proof that no such method can exist for matroids.</p>


Sign in / Sign up

Export Citation Format

Share Document