Back to Results
First PageMeta Content
Abstract algebra / Vector space / Matroid / Theorems and definitions in linear algebra / Infinite-dimensional holomorphy / Mathematics / Algebra / Submodular set function


A combinatorial algorithm minimizing submodular functions in strongly polynomial time Alexander Schrijver1
Add to Reading List

Document Date: 2004-08-26 06:01:18

Open Document

File Size: 101,04 KB

Share Result on Facebook

City

Amsterdam / Berlin / Calgary / New York / /

Country

Netherlands / /

Facility

University of Amsterdam / /

IndustryTerm

polynomial-time algorithm / combinatorial algorithm / nonellipsoidal algorithm / pseudopolynomial-time algorithm / /

Organization

Department of Mathematics / University of Amsterdam / /

Person

Lisa Fleischer / Bert Gerards / Frank Gerards / Bianca Spille / /

ProvinceOrState

Alberta / New York / /

Technology

Ring families Any algorithm / pseudopolynomial-time algorithm / combinatorial algorithm / strongly polynomial-time algorithm / nonellipsoidal algorithm / /

SocialTag