Applications of relaxed submodularity (Q1126827): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applications of relaxed submodularity |
scientific article |
Statements
Applications of relaxed submodularity (English)
0 references
5 August 1998
0 references
Summary: Combinatorial optimization problems often give rise to set-functions which satisfy the sub- or supermodular inequality only for certain pairs of subsets. Here we discuss connectivity problems and show how results on relaxed submodular functions help in solving them.
0 references
submodular functions
0 references
connectivity of graphs
0 references
connectivity problems
0 references
relaxed submodular functions
0 references
