Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
11 | Nikhil Bansal 0001, Bouke Cloostermans |
Minimizing Maximum Flow-time on Related Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 85-95, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
11 | Gai Liu, Zhiru Zhang |
A reconfigurable analog substrate for highly efficient maximum flow computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 52nd Annual Design Automation Conference, San Francisco, CA, USA, June 7-11, 2015, pp. 17:1-17:6, 2015, ACM, 978-1-4503-3520-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia Pac. J. Oper. Res. ![In: Asia Pac. J. Oper. Res. 31(4), 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
11 | Shengwei Han, Zixiong Peng, Shunqin Wang |
The maximum flow problem of uncertain network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 265, pp. 167-175, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
11 | Mette Gamst |
A local search heuristic for the Multi-Commodity $k$ -splittable Maximum Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 8(3), pp. 919-937, 2014. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.1839, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
11 | Peteris Daugulis |
Connectome graphs and maximum flow problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.6341, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
11 | Pawan Tamta, Bhagwati Prasad Pande, H. S. Dhami |
Reduction of Maximum Flow Network Interdiction Problem from The Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.2022, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
11 | Andrew V. Goldberg, Robert Endre Tarjan |
Efficient maximum flow algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 57(8), pp. 82-89, 2014. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 14(1), pp. 1-10, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
11 | Kelly M. Sullivan, J. Cole Smith |
Exact algorithms for solving a Euclidean maximum flow network interdiction problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 64(2), pp. 109-124, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
11 | Michal Kucharzak, Krzysztof Walkowiak |
Modeling and optimization of maximum flow survivable overlay multicast with predefined routing trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 56(1), pp. 121-139, 2014. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 424-433, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IECON ![In: IECON 2014 - 40th Annual Conference of the IEEE Industrial Electronics Society, Dallas, TX, USA, October 29 - November 1, 2014, pp. 3543-3548, 2014, IEEE, 978-1-4799-4032-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
11 | Arnaud Gotlieb, Dusica Marijan |
FLOWER: optimal test suite reduction as a network maximum flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: International Symposium on Software Testing and Analysis, ISSTA '14, San Jose, CA, USA - July 21 - 26, 2014, pp. 171-180, 2014, ACM, 978-1-4503-2645-2. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
11 | Fernando A. Kuipers, Song Yang 0002, Stojan Trajanovski, Ariel Orda |
Constrained Maximum Flow in Stochastic Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: 22nd IEEE International Conference on Network Protocols, ICNP 2014, Raleigh, NC, USA, October 21-24, 2014, pp. 397-408, 2014, IEEE Computer Society, 978-1-4799-6204-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
11 | Megha Sharma, Diptesh Ghosh |
Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 62(1), pp. 105-115, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
11 | Rasool Tahmasbi, Ebrahim Nasrabadi, S. Mehdi Hashemi |
The value of information in stochastic maximum flow problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 40(7), pp. 1744-1751, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
11 | Ajendra Dwivedi, Xinghuo Yu 0001 |
A Maximum-Flow-Based Complex Network Approach for Power System Vulnerability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Ind. Informatics ![In: IEEE Trans. Ind. Informatics 9(1), pp. 81-88, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Oper. Res. Soc. ![In: J. Oper. Res. Soc. 64(2), pp. 185-197, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
11 | Pawan Tamta, Bhagwati Prasad Pande, H. S. Dhami |
Cardinality Maximum Flow Network Interdiction Problem Vs. The Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1312.6492, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
11 | Björn Hlava |
Yet another approach to the Maximum Flow ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1302.3035, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
11 | Rahul Mehta 0002 |
A New Push-Relabel Algorithm for the Maximum Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.7840, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Secur. Commun. Networks ![In: Secur. Commun. Networks 6(9), pp. 1126-1142, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 61(2), pp. 117-127, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
11 | Clemens Thielen, Stephan Westphal |
Complexity and approximability of the maximum flow problem with minimum quantities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 62(2), pp. 125-131, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
11 | Ulrich Pferschy, Joachim Schauer |
The maximum flow problem with disjunctive constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 26(1), pp. 109-119, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
11 | Ran Duan |
Breaking the O(n2.5) Time Barrier for Undirected Unit-Capacity Maximum Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 1171-1179, 2013, SIAM, 978-1-61197-251-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
11 | Gary L. Miller, Richard Peng |
Approximate Maximum Flow on Separable Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 1151-1170, 2013, SIAM, 978-1-61197-251-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMLA (2) ![In: 12th International Conference on Machine Learning and Applications, ICMLA 2013, Miami, FL, USA, December 4-7, 2013, Volume 2, pp. 108-111, 2013, IEEE. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMC/HumanCom ![In: Advanced Technologies, Embedded and Multimedia for Human-centric Computing - HumanCom and EMC 2013 [International Conference on Human-centric Computing, HumanCom 2013 / 8th International Conference on Embedded and Multimedia Computing, EMC 2013, Taipei, Taiwan, August 23-25, 2013], pp. 429-439, 2013, Springer, 978-94-007-7261-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
11 | Marina Tvorogova |
Efficient Models for Special Types of Non-Linear Maximum Flow Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FedCSIS ![In: Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, Kraków, Poland, September 8-11, 2013., pp. 409-416, 2013, 978-1-4673-4471-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SACI ![In: IEEE 8th International Symposium on Applied Computational Intelligence and Informatics, SACI 2013, Timisoara, Romania, May 23-25, 2013, pp. 35-40, 2013, IEEE, 978-1-4673-6397-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (6) ![In: Computational Science and Its Applications - ICCSA 2013 - 13th International Conference, Ho Chi Minh City, Vietnam, June 24-27, 2013, Proceedings, Part VI, pp. 178-181, 2013, IEEE Computer Society, 978-0-7695-5045-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
11 | Longcheng Liu |
Inverse Maximum Flow Problems under the Combining Norms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW-AAIM ![In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings, pp. 221-230, 2013, Springer, 978-3-642-38755-5. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
11 | Shay Mozes |
Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
11 | Lianlong Wu, Kevin Curran |
A practical network coding and routing scheme based on maximum flow combination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Netw. Manag. ![In: Int. J. Netw. Manag. 22(5), pp. 373-396, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Cenk Çaliskan |
A faster polynomial algorithm for the constrained maximum flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 39(11), pp. 2634-2641, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Cenk Çaliskan |
A computational study of the capacity scaling algorithm for the maximum flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 39(11), pp. 2742-2747, 2012. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Math. Appl. ![In: Comput. Math. Appl. 63(2), pp. 481-491, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Jannik Matuschke, Britta Peis |
Lattices and maximum flow algorithms in planar graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1211.2189, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
11 | Gary L. Miller, Richard Peng |
Approximate Maximum Flow on Separable Undirected Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1210.5227, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
11 | Mette Gamst, B. Petersen |
Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 217(2), pp. 278-286, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Paolo Serafini, Bruno Simeone |
Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 59(2), pp. 191-208, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Alireza Nazemi, Farahnaz Omidi |
A capable neural network model for solving the maximum flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Appl. Math. ![In: J. Comput. Appl. Math. 236(14), pp. 3498-3513, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Makhlouf Hadji, Djamal Zeghlache |
Minimum Cost Maximum Flow Algorithm for Dynamic Resource Allocation in Clouds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE CLOUD ![In: 2012 IEEE Fifth International Conference on Cloud Computing, Honolulu, HI, USA, June 24-29, 2012, pp. 876-882, 2012, IEEE Computer Society, 978-1-4673-2892-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Martin Waßmann, Karsten Weicker |
Maximum Flow Networks for Stability Analysis of LEGO®Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, pp. 813-824, 2012, Springer, 978-3-642-33089-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TJJCCGG ![In: Computational Geometry and Graphs - Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected Papers, pp. 132-142, 2012, Springer, 978-3-642-45280-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Lifeng Zhao, Xiaowan Meng |
An improved algorithm for solving maximum flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC ![In: Eighth International Conference on Natural Computation, ICNC 2012, 29-31 May 2012, Chongqing, China, pp. 1016-1018, 2012, IEEE, 978-1-4577-2130-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Michal Kucharzak, Krzysztof Walkowiak |
Maximum flow trees in overlay multicast: Modeling and optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BCFIC ![In: 2nd Baltic Congress on Future Internet Communications, BCFIC 2012, Vilnius, Lithuania, April 25-27, 2012, pp. 260-267, 2012, IEEE, 978-1-4673-1672-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Xiaoyun He, Jaideep Vaidya, Basit Shafiq, Nabil R. Adam |
Privacy Preserving Maximum-Flow Computation in Distributed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SocialCom/PASSAT ![In: 2012 International Conference on Privacy, Security, Risk and Trust, PASSAT 2012, and 2012 International Confernece on Social Computing, SocialCom 2012, Amsterdam, Netherlands, September 3-5, 2012, pp. 684-693, 2012, IEEE Computer Society, 978-1-4673-5638-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Nihat Altiparmak, Ali Saman Tosun |
Integrated Maximum Flow Algorithm for Optimal Response Time Retrieval of Replicated Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 41st International Conference on Parallel Processing, ICPP 2012, Pittsburgh, PA, USA, September 10-13, 2012, pp. 11-20, 2012, IEEE Computer Society, 978-1-4673-2508-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
11 | Yanping Zhang, Xiansheng Xu, Bo Hua, Shu Zhao |
Contracting community for computing maximum flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GrC ![In: 2012 IEEE International Conference on Granular Computing, GrC 2012, Hangzhou, China, August 11-13, 2012, pp. 651-656, 2012, IEEE Computer Society, 978-1-4673-2310-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 184(1), pp. 3-26, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Wenhua Li, Jinjiang Yuan |
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 111(18), pp. 907-911, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Haim Kaplan, Yahav Nussbaum |
Maximum Flow in Directed Planar Graphs with Vertex Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 61(1), pp. 174-189, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(4-5), pp. 391-401, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 16, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Networks ![In: J. Networks 6(6), pp. 879-882, 2011. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1105.2228, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP 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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1104.4728, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
11 | Cenk Çaliskan |
A specialized network simplex algorithm for the constrained maximum flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 210(2), pp. 137-147, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Ibrahim Akgün, Barbaros Ç. Tansel, R. Kevin Wood |
The multi-terminal maximum-flow network-interdiction problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 211(2), pp. 241-251, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Frauke Liers, G. Pardella |
Simplifying maximum flow computations: The effect of shrinking and good initial flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 159(17), pp. 2187-2203, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Alessandro Bogliolo, Saverio Delpriori, Emanuele Lattanzi, Andrea Seraghiti |
Self-adapting maximum flow routing for autonomous wireless sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Clust. Comput. ![In: Clust. Comput. 14(1), pp. 1-14, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Camille Couprie, Leo J. Grady, Hugues Talbot, Laurent Najman |
Combinatorial Continuous Maximum Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Imaging Sci. ![In: SIAM J. Imaging Sci. 4(3), pp. 905-930, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTC Spring ![In: Proceedings of the 73rd IEEE Vehicular Technology Conference, VTC Spring 2011, 15-18 May 2011, Budapest, Hungary, pp. 1-6, 2011, IEEE, 978-1-4244-8331-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Chen Zhou, Jin Peng |
Models and Algorithm of Maximum Flow Problem in Uncertain Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICI (1) ![In: Artificial Intelligence and Computational Intelligence - Third International Conference, AICI 2011, Taiyuan, China, September 24-25, 2011, Proceedings, Part I, pp. 101-109, 2011, Springer, 978-3-642-23880-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pp. 170-179, 2011, IEEE Computer Society, 978-1-4577-1843-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings, pp. 571-582, 2011, Springer, 978-3-642-22299-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Ulrich Pferschy, Joachim Schauer |
The Maximum Flow Problem with Conflict and Forcing Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INOC ![In: Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, pp. 289-294, 2011, Springer, 978-3-642-21526-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Katherine C. Hastings, Douglas R. Shier |
Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INOC ![In: Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, pp. 295-308, 2011, Springer, 978-3-642-21526-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, pp. 192-202, 2011, IEEE Computer Society, 978-0-7695-4364-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Peijun Ye, Cheng Chen, Fenghua Zhu |
Dynamic route guidance using maximum flow theory and its MapReduce implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITSC ![In: 14th International IEEE Conference on Intelligent Transportation Systems, ITSC 2011, Washington, DC, USA, October 5-7, 2011, pp. 180-185, 2011, IEEE, 978-1-4577-2198-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pp. 273-282, 2011, ACM, 978-1-4503-0691-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30 - September 2, 2011, Zurich, Switzerland, pp. 83-88, 2011, Springer, 978-3-642-29209-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: Seventh International Conference on Computational Intelligence and Security, CIS 2011, Sanya, Hainan, China, December 3-4, 2011, pp. 482-486, 2011, IEEE Computer Society, 978-1-4577-2008-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Li Wanqi, Nian Che, Jinlin Ren, Hongyue You |
Histogram-Preserving Steganography Using Maximum Flow Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDMA ![In: Second International Conference on Digital Manufacturing and Automation, ICDMA 2011, Zhangjiajie, Hunan, China, August 5-7, 2011, pp. 590-593, 2011, IEEE Computer Society, 978-1-4577-0755-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
11 | Dag Haugland, Mujahed Eleyat, Magnus Lie Hetland |
The Maximum Flow Problem with Minimum Lot Sizes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCL ![In: Computational Logistics - Second International Conference, ICCL 2011, Hamburg, Germany, September 19-22, 2011. Proceedings, pp. 170-182, 2011, Springer, 978-3-642-24263-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Optim. Appl. ![In: Comput. Optim. Appl. 47(2), pp. 289-305, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 38(1), pp. 33-38, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
11 | Endre Csóka |
Maximum flow is approximable by deterministic constant-time algorithm in sparse networks ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1005.0513, 2010. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1012.5870, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
11 | Yahav Nussbaum |
Multiple-source multiple-sink maximum flow in planar graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1012.4767, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
11 | Barak Fishbain, Dorit S. Hochbaum, Stefan Müller |
Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1007.4531, 2010. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1010.2921, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
11 | Glencora Borradaile, Christian Wulff-Nilsen |
Multiple source, single sink maximum flow in a planar graph ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1008.4966, 2010. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1008.5332, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
11 | Steffen Rebennack, Ashwin Arulselvan, Lily Elefteriadou, Panos M. Pardalos |
Complexity analysis for maximum flow problems with arc reversals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 19(2), pp. 200-216, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
11 | Jannik Matuschke |
Lattices and Maximum Flow Algorithms in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTW ![In: 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts, pp. 123-127, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
11 | Beate Bollig |
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings, pp. 186-197, 2010, Springer, 978-3-642-15154-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
11 | Jannik Matuschke, Britta Peis |
Lattices and Maximum Flow Algorithms in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers, pp. 324-335, 2010, 978-3-642-16925-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 24th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010, Atlanta, Georgia, USA, 19-23 April 2010 - Conference Proceedings, pp. 1-10, 2010, IEEE. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
11 | Cui-xia Xu |
Research on the Maximum Flow Problem with Multiple Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBTA ![In: Second International Workshop on Database Technology and Applications, DBTA 2010, Wuhan, Hubei, China, November 27-28, 2010, Proceedings, pp. 1-4, 2010, IEEE, 978-1-4244-6977-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIC-TA ![In: Fifth International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010, University of Hunan, Liverpool Hope University, Liverpool, United Kingdom / Changsha, China, September 8-10 and September 23-26, 2010, pp. 137-142, 2010, IEEE, 978-1-4244-6437-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 57(2), pp. 358-376, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
11 | Donald Goldfarb, Wotao Yin |
Parametric Maximum Flow Algorithms for Fast Total Variation Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Sci. Comput. ![In: SIAM J. Sci. Comput. 31(5), pp. 3712-3743, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
11 | Haim Kaplan, Yahav Nussbaum |
Maximum Flow in Directed Planar Graphs with Vertex Capacities ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0905.0451, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
11 | Cenk Çaliskan |
On a capacity scaling algorithm for the constrained maximum flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 53(3), pp. 229-230, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICUMT ![In: Proceedings of the International Conference on Ultra Modern Telecommunications, ICUMT 2009, 12-14 October 2009, St. Petersburg, Russia, pp. 1-6, 2009, IEEE, 978-1-4244-3942-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|