A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three 'algorithmic metatheorems.' (1) If the constraint is specified by a monadic second-order logic on a graph of bounded treewidth, the problem is solved in n^O(1) time with an approximation factor of O( n). (2) If the constraint is specified by a first-order logic on a graph of low degree, the problem is solved in O(n^1 + ϵ) time for any ϵ > 0arXiv:1807.04575v1 fatcat:ye2o43726zfyvfc7vijifqaptm