Sciweavers

2816 search results - page 2 / 564
» Submodular function minimization
Sort
View
JCT
2000
103views more  JCT 2000»
13 years 5 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
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 ...
Alexander Schrijver
JMLR
2010
187views more  JMLR 2010»
13 years 11 days ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
SODA
2008
ACM
75views Algorithms» more  SODA 2008»
13 years 7 months ago
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
S. Thomas McCormick, Satoru Fujishige
SPAA
2010
ACM
13 years 5 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
MP
2008
42views more  MP 2008»
13 years 5 months ago
Submodular function minimization
Satoru Iwata