Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

JCT
2000

favoriteEmaildiscussreport

103views more JCT 2000»

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

13 years 4 months ago

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

Download homepages.cwi.nl

We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle calls is bounded by a polynomial in the size of the underlying set.

Alexander Schrijver

Real-time Traffic

Ellipsoid Method | JCT 2000 | Linear Programming Method | Polynomial-time Algorithm |

claim paper

Related Content

» Efficient Minimization of Decomposable Submodular Functions

» Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimizat...

» Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency

» Bisubmodular Function Minimization

» Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions

» Minimizing Symmetric Set Functions Faster

» A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

» PAClearning Bounded Treewidth Graphical Models

» An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Dupli...

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	JCT
Authors	Alexander Schrijver

Comments (0)