Search results for "preflow-push"

Found 17 publication records. Showing 17 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
134	Joseph Cheriyan, S. N. Maheshwari	Analysis of Preflow Push Algorithms for Maximum Network Flow.	FSTTCS	1988	DBLP DOI BibTeX RDF
105	Wilhelm Cronholm, Farid Ajili, Sofia Panagiotidi	On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price.	CPAIOR	2005	DBLP DOI BibTeX RDF	preflow-push algorithms, networks, Steiner trees, branch-and-cut
75	Thuy Lien Pham, Marc Bui, Ivan Lavallée, Si Hoàng Do	A Distributed Preflow-Push for the Maximum Flow Problem.	IICS	2005	DBLP DOI BibTeX RDF
59	Éva Tardos, Kevin D. Wayne	Simple Generalized Maximum Flow Algorithms.	IPCO	1998	DBLP DOI BibTeX RDF
45	Raffaele Cerulli, Monica Gentili, Antonio Iossa	Efficient preflow push algorithms.	Comput. Oper. Res.	2008	DBLP DOI BibTeX RDF
45	Marc Meister	Fine-grained Parallel Implementation of the Preflow-Push Algorithm in CHR.	WLP	2006	DBLP BibTeX RDF
45	Joseph Cheriyan, Kurt Mehlhorn	An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow.	Inf. Process. Lett.	1999	DBLP DOI BibTeX RDF
45	Levent Tunçel	On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems.	Algorithmica	1994	DBLP DOI BibTeX RDF
45	Joseph Cheriyan, S. N. Maheshwari	Analysis of Preflow Push Algorithms for Maximum Network Flow.	SIAM J. Comput.	1989	DBLP DOI BibTeX RDF
45	Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin	Maximum Flow Problem.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Minimum cut problem, Augmenting path algorithm, Preflow-push algorithm, Max-flow min-cut theorem, Network, Maximum flow problem
45	Patrick P. C. Lee, Vishal Misra, Dan Rubenstein	Distributed algorithms for secure multipath routing in attack-resistant networks.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	attack-resistant networks, preflow-push, security, optimization, resilience, multipath routing, maximum-flow problems
45	Monika Rauch Henzinger, Satish Rao, Harold N. Gabow	Computing Vertex Connectivity: New Bounds from Old Techniques.	FOCS	1996	DBLP DOI BibTeX RDF	smallest number of vertices, preflow push algorithm, computational geometry, deterministic algorithm, digraph, error probability, vertex connectivity
30	Jan M. Hochstein, Karsten Weihe	Maximum s-t-flow with k crossings in O(k3n log n) time.	SODA	2007	DBLP BibTeX RDF
30	Chung-Cheng Chiu, Von-Wun Soo	Subgoal Identification for Reinforcement Learning and Planning in Multiagent Problem Solving.	MATES	2007	DBLP DOI BibTeX RDF
30	Thuy Lien Pham, Ivan Lavallée, Marc Bui, Si Hoàng Do	A Distributed Algorithm for the Maximum Flow Problem.	ISPDC	2005	DBLP DOI BibTeX RDF
30	Pierre Senellart	Identifying Websites with Flow Simulation.	ICWE	2005	DBLP DOI BibTeX RDF
30	Martin Gairing, Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien	Computing Nash equilibria for scheduling on restricted parallel links.	STOC	2004	DBLP DOI BibTeX RDF	approximation algorithms, Nash equilibria, selfish routing, unsplittable flow, machine scheduling