A Logarithmic Approximation for Unsplittable Flow on Line Graphs

doi 10.1137/1.9781611973068.77
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Submodular Unsplittable Flow on Trees

Mathematical Programming, Series B
MathematicsSoftware
2018English

Submodular Unsplittable Flow on Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

On Hamiltonian Line-Graphs

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1968English

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1999English

A Note on Cycle Spectra of Line Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Spectral Compensation for Linear-Logarithmic Flow Cytometry Acquisitions

Journal of Biomedical Science and Engineering
2014English

Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy