Greedy approximation algorithms for generalized maximum flow problem towards relation extraction in information networks
DOI10.1007/978-3-642-45281-9_13zbMATH Open1406.68089OpenAlexW127711544MaRDI QIDQ2864337FDOQ2864337
Authors: Yusuke Nojima, Yasuhito Asano, Masatoshi Yoshikawa 
Publication date: 6 December 2013
Published in: Computational Geometry and Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45281-9_13
Recommendations
- Faster algorithms for the generalized network flow problem
- A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
- Generalized max flow in series-parallel graphs
- scientific article; zbMATH DE number 1187161
- New algorithms for generalized network flows
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Signed and weighted graphs (05C22)
This page was built for publication: Greedy approximation algorithms for generalized maximum flow problem towards relation extraction in information networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864337)
