Applications of relaxed submodularity

MaRDI QIDQ1126827zbMATH OpenFDO

Authors András Frank

Publication date 5 August 1998

Published in Documenta Mathematica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/223881, http://www.emis.de/journals/DMJDMV/xvol-icm/13/Frank.MAN.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

connectivity of graphsconnectivity problemsrelaxed submodular functionssubmodular functions

Mathematics Subject Classification ID

Connectivity (05C40) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 446490
• scientific article; zbMATH DE number 3912107
• scientific article; zbMATH DE number 3904328
• scientific article; zbMATH DE number 3898611
• Submodular function minimization

Cited in

(4)

• Relaxed submonotone mappings
• Submodularity and its application to some global constraints
• On \(k\)-submodular relaxation
• scientific article; zbMATH DE number 446490 (Why is no real title available?)

This page was built for publication: Applications of relaxed submodularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126827)