Submodular Unsplittable Flow on Trees

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-33461-5_28
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Submodular Unsplittable Flow on Trees

Mathematical Programming, Series B
MathematicsSoftware
2018English

A Logarithmic Approximation for Unsplittable Flow on Line Graphs

2009English

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

How Unsplittable-Flow-Covering Helps Scheduling With Job-Dependent Cost Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Submodular Percolation

SIAM Journal on Discrete Mathematics
Mathematics
2009English

Subspace Selection via DR-Submodular Maximization on Lattices

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Note on Pseudolattices, Lattices and Submodular Linear Programs

Discrete Optimization
Computational TheoryApplied MathematicsTheoretical Computer ScienceMathematics
2008English

On Greedy Algorithms, Partially Ordered Sets, and Submodular Functions

IBM Journal of Research and Development
Computer Science
2003English

The Online Submodular Cover Problem

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy