Search results for "maximum-flow"

Hits ?▲	Authors	Title	Venue	Year	Link
11	Nikhil Bansal 0001, Bouke Cloostermans	Minimizing Maximum Flow-time on Related Machines.	APPROX-RANDOM	2015	DBLP DOI BibTeX RDF
11	Gai Liu, Zhiru Zhang	A reconfigurable analog substrate for highly efficient maximum flow computation.	DAC	2015	DBLP DOI BibTeX RDF
11	Chengwen Jiao, Wenhua Li, Jinjiang Yuan	A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines.	Asia Pac. J. Oper. Res.	2014	DBLP DOI BibTeX RDF
11	Shengwei Han, Zixiong Peng, Shunqin Wang	The maximum flow problem of uncertain network.	Inf. Sci.	2014	DBLP DOI BibTeX RDF
11	Mette Gamst	A local search heuristic for the Multi-Commodity $k$ -splittable Maximum Flow Problem.	Optim. Lett.	2014	DBLP DOI BibTeX RDF
11	Anamitra Roy Choudhury, Syamantak Das, Naveen Garg 0001, Amit Kumar 0001	Rejecting Jobs to Minimize Load and Maximum Flow-time.	CoRR	2014	DBLP BibTeX RDF
11	Peteris Daugulis	Connectome graphs and maximum flow problems.	CoRR	2014	DBLP BibTeX RDF
11	Pawan Tamta, Bhagwati Prasad Pande, H. S. Dhami	Reduction of Maximum Flow Network Interdiction Problem from The Clique Problem.	CoRR	2014	DBLP BibTeX RDF
11	Andrew V. Goldberg, Robert Endre Tarjan	Efficient maximum flow algorithms.	Commun. ACM	2014	DBLP DOI BibTeX RDF
11	Henry Amankwah, Torbjörn Larsson, Björn Textorius	A maximum flow formulation of a multi-period open-pit mining problem.	Oper. Res.	2014	DBLP DOI BibTeX RDF
11	Kelly M. Sullivan, J. Cole Smith	Exact algorithms for solving a Euclidean maximum flow network interdiction problem.	Networks	2014	DBLP DOI BibTeX RDF
11	Michal Kucharzak, Krzysztof Walkowiak	Modeling and optimization of maximum flow survivable overlay multicast with predefined routing trees.	Telecommun. Syst.	2014	DBLP DOI BibTeX RDF
11	Yin Tat Lee, Aaron Sidford	Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow.	FOCS	2014	DBLP DOI BibTeX RDF
11	Jinjian Wang, Xinghuo Yu 0001, Brendan P. McGrath, Jiangxia Zhong	Identifying line vulnerability in power system using maximum flow based complex network theory.	IECON	2014	DBLP DOI BibTeX RDF
11	Arnaud Gotlieb, Dusica Marijan	FLOWER: optimal test suite reduction as a network maximum flow.	ISSTA	2014	DBLP DOI BibTeX RDF
11	Fernando A. Kuipers, Song Yang 0002, Stojan Trajanovski, Ariel Orda	Constrained Maximum Flow in Stochastic Networks.	ICNP	2014	DBLP DOI BibTeX RDF
11	Megha Sharma, Diptesh Ghosh	Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable Networks.	IEEE Trans. Reliab.	2013	DBLP DOI BibTeX RDF
11	Rasool Tahmasbi, Ebrahim Nasrabadi, S. Mehdi Hashemi	The value of information in stochastic maximum flow problems.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
11	Ajendra Dwivedi, Xinghuo Yu 0001	A Maximum-Flow-Based Complex Network Approach for Power System Vulnerability Analysis.	IEEE Trans. Ind. Informatics	2013	DBLP DOI BibTeX RDF
11	Mohammad Waqar Ali Asad, Roussos G. Dimitrakopoulos	Implementing a parametric maximum flow algorithm for optimal open pit mine design under uncertain supply and demand.	J. Oper. Res. Soc.	2013	DBLP DOI BibTeX RDF
11	Pawan Tamta, Bhagwati Prasad Pande, H. S. Dhami	Cardinality Maximum Flow Network Interdiction Problem Vs. The Clique Problem.	CoRR	2013	DBLP BibTeX RDF
11	Björn Hlava	Yet another approach to the Maximum Flow	CoRR	2013	DBLP BibTeX RDF
11	Rahul Mehta 0002	A New Push-Relabel Algorithm for the Maximum Flow Problem.	CoRR	2013	DBLP BibTeX RDF
11	Xinxin Fan, Mingchu Li, Hui Zhao, Xiaodong Chen, Zhenzhou Guo, Dong Jiao, Weifeng Sun	Peer cluster: a maximum flow-based trust mechanism in P2P file sharing networks.	Secur. Commun. Networks	2013	DBLP DOI BibTeX RDF
11	Katherine C. Hastings, Douglas R. Shier	Algebraic methods applied to shortest path and maximum flow problems in stochastic networks.	Networks	2013	DBLP DOI BibTeX RDF
11	Clemens Thielen, Stephan Westphal	Complexity and approximability of the maximum flow problem with minimum quantities.	Networks	2013	DBLP DOI BibTeX RDF
11	Ulrich Pferschy, Joachim Schauer	The maximum flow problem with disjunctive constraints.	J. Comb. Optim.	2013	DBLP DOI BibTeX RDF
11	Ran Duan	Breaking the O(n2.5) Time Barrier for Undirected Unit-Capacity Maximum Flow.	SODA	2013	DBLP DOI BibTeX RDF
11	Gary L. Miller, Richard Peng	Approximate Maximum Flow on Separable Undirected Graphs.	SODA	2013	DBLP DOI BibTeX RDF
11	Viktor Arkhipov, Maxim Buzdalov 0001, Anatoly Shalyto 0001	Worst-Case Execution Time Test Generation for Augmenting Path Maximum Flow Algorithms Using Genetic Algorithms.	ICMLA (2)	2013	DBLP DOI BibTeX RDF
11	Kai Peng, Rongheng Lin, Binbin Huang, Hua Zou, Fangchun Yang	Assessment of Performance in Data Center Network Based on Maximum Flow.	EMC/HumanCom	2013	DBLP DOI BibTeX RDF
11	Marina Tvorogova	Efficient Models for Special Types of Non-Linear Maximum Flow Problems.	FedCSIS	2013	DBLP BibTeX RDF
11	Elisa Valentina Moisi, Benedek Nagy, Vladimir-Ioan Cretu	Maximum flow minimum cost algorithm for reconstruction of images represented on the triangular grid.	SACI	2013	DBLP DOI BibTeX RDF
11	Chien Tran Quoc, Lau Nguyen Dinh, Trinh Nguyen Thi Tu	Sequential and Parallel Algorithm by Postflow-Pull Methods to Find Maximum Flow.	ICCSA (6)	2013	DBLP DOI BibTeX RDF
11	Longcheng Liu	Inverse Maximum Flow Problems under the Combining Norms.	FAW-AAIM	2013	DBLP DOI BibTeX RDF
11	Shay Mozes	Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.		2013	RDF
11	Lianlong Wu, Kevin Curran	A practical network coding and routing scheme based on maximum flow combination.	Int. J. Netw. Manag.	2012	DBLP DOI BibTeX RDF
11	Cenk Çaliskan	A faster polynomial algorithm for the constrained maximum flow problem.	Comput. Oper. Res.	2012	DBLP DOI BibTeX RDF
11	Cenk Çaliskan	A computational study of the capacity scaling algorithm for the maximum flow problem.	Comput. Oper. Res.	2012	DBLP DOI BibTeX RDF
11	Neeraj Kumar 0001, Naveen K. Chilamkurti, Jong-Hyouk Lee	A novel minimum delay maximum flow multicast algorithm to construct a multicast tree in wireless mesh networks.	Comput. Math. Appl.	2012	DBLP DOI BibTeX RDF
11	Jannik Matuschke, Britta Peis	Lattices and maximum flow algorithms in planar graphs	CoRR	2012	DBLP BibTeX RDF
11	Gary L. Miller, Richard Peng	Approximate Maximum Flow on Separable Undirected Graphs	CoRR	2012	DBLP BibTeX RDF
11	Mette Gamst, B. Petersen	Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem.	Eur. J. Oper. Res.	2012	DBLP DOI BibTeX RDF
11	Paolo Serafini, Bruno Simeone	Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment.	Networks	2012	DBLP DOI BibTeX RDF
11	Alireza Nazemi, Farahnaz Omidi	A capable neural network model for solving the maximum flow problem.	J. Comput. Appl. Math.	2012	DBLP DOI BibTeX RDF
11	Makhlouf Hadji, Djamal Zeghlache	Minimum Cost Maximum Flow Algorithm for Dynamic Resource Allocation in Clouds.	IEEE CLOUD	2012	DBLP DOI BibTeX RDF
11	Martin Waßmann, Karsten Weicker	Maximum Flow Networks for Stability Analysis of LEGO®Structures.	ESA	2012	DBLP DOI BibTeX RDF
11	Yusuke Nojima, Yasuhito Asano, Masatoshi Yoshikawa	Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks.	TJJCCGG	2012	DBLP DOI BibTeX RDF
11	Lifeng Zhao, Xiaowan Meng	An improved algorithm for solving maximum flow problem.	ICNC	2012	DBLP DOI BibTeX RDF
11	Michal Kucharzak, Krzysztof Walkowiak	Maximum flow trees in overlay multicast: Modeling and optimization.	BCFIC	2012	DBLP DOI BibTeX RDF
11	Xiaoyun He, Jaideep Vaidya, Basit Shafiq, Nabil R. Adam	Privacy Preserving Maximum-Flow Computation in Distributed Graphs.	SocialCom/PASSAT	2012	DBLP DOI BibTeX RDF
11	Nihat Altiparmak, Ali Saman Tosun	Integrated Maximum Flow Algorithm for Optimal Response Time Retrieval of Replicated Data.	ICPP	2012	DBLP DOI BibTeX RDF
11	Yanping Zhang, Xiansheng Xu, Bo Hua, Shu Zhao	Contracting community for computing maximum flow.	GrC	2012	DBLP DOI BibTeX RDF
11	Douglas S. Altner, Özlem Ergun	Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems.	Ann. Oper. Res.	2011	DBLP DOI BibTeX RDF
11	Wenhua Li, Jinjiang Yuan	Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
11	Haim Kaplan, Yahav Nussbaum	Maximum Flow in Directed Planar Graphs with Vertex Capacities.	Algorithmica	2011	DBLP DOI BibTeX RDF
11	Franz-Josef Brandenburg, Mao-cheng Cai	Shortest path and maximum flow problems in networks with additive losses and gains.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
11	Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein 0001, Cristian George Strat	Solving maximum flow problems on real-world bipartite graphs.	ACM J. Exp. Algorithmics	2011	DBLP DOI BibTeX RDF
11	Yahuan Wei, Taoshen Li, Zhihui Ge	A Channel Assignment Algorithm for Wireless Mesh Networks Using the Maximum Flow Approach.	J. Networks	2011	DBLP DOI BibTeX RDF
11	Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	CoRR	2011	DBLP BibTeX RDF
11	Philip N. Klein, Shay Mozes	Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameternlog(n)) Time	CoRR	2011	DBLP BibTeX RDF
11	Cenk Çaliskan	A specialized network simplex algorithm for the constrained maximum flow problem.	Eur. J. Oper. Res.	2011	DBLP DOI BibTeX RDF
11	Ibrahim Akgün, Barbaros Ç. Tansel, R. Kevin Wood	The multi-terminal maximum-flow network-interdiction problem.	Eur. J. Oper. Res.	2011	DBLP DOI BibTeX RDF
11	Frauke Liers, G. Pardella	Simplifying maximum flow computations: The effect of shrinking and good initial flows.	Discret. Appl. Math.	2011	DBLP DOI BibTeX RDF
11	Alessandro Bogliolo, Saverio Delpriori, Emanuele Lattanzi, Andrea Seraghiti	Self-adapting maximum flow routing for autonomous wireless sensor networks.	Clust. Comput.	2011	DBLP DOI BibTeX RDF
11	Camille Couprie, Leo J. Grady, Hugues Talbot, Laurent Najman	Combinatorial Continuous Maximum Flow.	SIAM J. Imaging Sci.	2011	DBLP DOI BibTeX RDF
11	Changliang Zheng, Ren Ping Liu, Xun Yang, Iain B. Collings, Zheng Zhou, Eryk Dutkiewicz	Maximum Flow-Segment Based Channel Assignment and Routing in Cognitive Radio Networks.	VTC Spring	2011	DBLP DOI BibTeX RDF
11	Chen Zhou, Jin Peng	Models and Algorithm of Maximum Flow Problem in Uncertain Network.	AICI (1)	2011	DBLP DOI BibTeX RDF
11	Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.	FOCS	2011	DBLP DOI BibTeX RDF
11	Philip N. Klein, Shay Mozes	Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time.	WADS	2011	DBLP DOI BibTeX RDF
11	Ulrich Pferschy, Joachim Schauer	The Maximum Flow Problem with Conflict and Forcing Conditions.	INOC	2011	DBLP DOI BibTeX RDF
11	Katherine C. Hastings, Douglas R. Shier	Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems.	INOC	2011	DBLP DOI BibTeX RDF
11	Felix Halim, Roland H. C. Yap, Yongzheng Wu	A MapReduce-Based Maximum-Flow Algorithm for Large Small-World Network Graphs.	ICDCS	2011	DBLP DOI BibTeX RDF
11	Peijun Ye, Cheng Chen, Fenghua Zhu	Dynamic route guidance using maximum flow theory and its MapReduce implementation.	ITSC	2011	DBLP DOI BibTeX RDF
11	Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng	Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs.	STOC	2011	DBLP DOI BibTeX RDF
11	Mujahed Eleyat, Dag Haugland, Magnus Lie Hetland, Lasse Natvig	Parallel algorithms for the maximum flow problem with minimum lot sizes.	OR	2011	DBLP DOI BibTeX RDF
11	Yanping Zhang, Bo Hua, Juan Jiang, Yuan Zhang, Xiaoyan Chen	Research on the Maximum Flow in Large-scale Network.	CIS	2011	DBLP DOI BibTeX RDF
11	Li Wanqi, Nian Che, Jinlin Ren, Hongyue You	Histogram-Preserving Steganography Using Maximum Flow Algorithms.	ICDMA	2011	DBLP DOI BibTeX RDF
11	Dag Haugland, Mujahed Eleyat, Magnus Lie Hetland	The Maximum Flow Problem with Minimum Lot Sizes.	ICCL	2011	DBLP DOI BibTeX RDF
11	Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez	A new strategy for the undirected two-commodity maximum flow problem.	Comput. Optim. Appl.	2010	DBLP DOI BibTeX RDF
11	Douglas S. Altner, Özlem Ergun, Nelson A. Uhan	The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF
11	Endre Csóka	Maximum flow is approximable by deterministic constant-time algorithm in sparse networks	CoRR	2010	DBLP BibTeX RDF
11	Shay Mozes	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time	CoRR	2010	DBLP BibTeX RDF
11	Yahav Nussbaum	Multiple-source multiple-sink maximum flow in planar graphs	CoRR	2010	DBLP BibTeX RDF
11	Barak Fishbain, Dorit S. Hochbaum, Stefan Müller	Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems	CoRR	2010	DBLP BibTeX RDF
11	Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng	Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs	CoRR	2010	DBLP BibTeX RDF
11	Glencora Borradaile, Christian Wulff-Nilsen	Multiple source, single sink maximum flow in a planar graph	CoRR	2010	DBLP BibTeX RDF
11	Philip N. Klein, Shay Mozes	Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time	CoRR	2010	DBLP BibTeX RDF
11	Steffen Rebennack, Ashwin Arulselvan, Lily Elefteriadou, Panos M. Pardalos	Complexity analysis for maximum flow problems with arc reversals.	J. Comb. Optim.	2010	DBLP DOI BibTeX RDF
11	Jannik Matuschke	Lattices and Maximum Flow Algorithms in Planar Graphs.	CTW	2010	DBLP BibTeX RDF
11	Beate Bollig	Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks.	MFCS	2010	DBLP DOI BibTeX RDF
11	Jannik Matuschke, Britta Peis	Lattices and Maximum Flow Algorithms in Planar Graphs.	WG	2010	DBLP DOI BibTeX RDF
11	Zhengyu He, Bo Hong	Dynamically tuned push-relabel algorithm for the maximum flow problem on CPU-GPU-Hybrid platforms.	IPDPS	2010	DBLP DOI BibTeX RDF
11	Cui-xia Xu	Research on the Maximum Flow Problem with Multiple Solutions.	DBTA	2010	DBLP DOI BibTeX RDF
11	Kang Zhou, Yufang Huang, Zhen Cheng, Yafei Dong	The application of fixed-length three DNA Segments encoding to maximum flow problem.	BIC-TA	2010	DBLP DOI BibTeX RDF
11	Bala G. Chandran, Dorit S. Hochbaum	A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem.	Oper. Res.	2009	DBLP DOI BibTeX RDF
11	Donald Goldfarb, Wotao Yin	Parametric Maximum Flow Algorithms for Fast Total Variation Minimization.	SIAM J. Sci. Comput.	2009	DBLP DOI BibTeX RDF
11	Haim Kaplan, Yahav Nussbaum	Maximum Flow in Directed Planar Graphs with Vertex Capacities	CoRR	2009	DBLP BibTeX RDF
11	Cenk Çaliskan	On a capacity scaling algorithm for the constrained maximum flow problem.	Networks	2009	DBLP DOI BibTeX RDF
11	Pasquale Gurzi, Walter Colitti, Kris Steenhaut, Ann Nowé	Maximum flow based Routing and Wavelength Assignment in all-optical networks.	ICUMT	2009	DBLP DOI BibTeX RDF