A strongly polynomial algorithm for line search in submodular polyhedra

Authors:
Kiyohito Nagano
Affiliations:
Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Bunkyo-ku, Tokyo 113-8656, Japan
Venue:
Discrete Optimization
Year:
2007

Citing 10
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A Submodular Optimization Problem with Side Constraints

Mathematics of Operations Research
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)
A strongly polynomial time algorithm for a constrained submodular optimization problem

Discrete Applied Mathematics
A fully combinatorial algorithm for submodular function minimization

Journal of Combinatorial Theory Series B
A note on Schrijver's submodular function minimization algorithm

Journal of Combinatorial Theory Series B
Discrete Convex Analysis: Monographs on Discrete Mathematics and Applications 10

Discrete Convex Analysis: Monographs on Discrete Mathematics and Applications 10
A push-relabel framework for submodular function minimization and applications to parametric optimization

Discrete Applied Mathematics - Submodularity

A simple combinatorial algorithm for submodular function minimization

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A submodular polyhedron is a polyhedron associated with a submodular function. This paper presents a strongly polynomial time algorithm for line search in submodular polyhedra with the aid of a fully combinatorial algorithm for submodular function minimization. The algorithm is based on the parametric search method proposed by Megiddo.