Search results for "maximum-flow"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
53	Maria Grazia Scutellà	A note on the parametric maximum flow problem and some related reoptimization issues.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Parametric arc capacity, Maximum flow
46	Min Xie, Lixin Gao, Haiwa Guan	Ant Algorithm Applied in the Minimal Cost Maximum Flow Problem.	ICIC (2)	2008	DBLP DOI BibTeX RDF	minimal cost maximum flow problem, ant algorithm, directed network
46	Sukumar Ghosh, Arobinda Gupta, Sriram V. Pemmaraju	A Self-Stabilizing Algorithm for the Maximum Flow Problem.	Distributed Comput.	1997	DBLP DOI BibTeX RDF	Fault-tolerance, Distributed algorithms, Self-stabilization, Maximum flow
45	Julia Chuzhoy, Sanjeev Khanna	Polynomial flow-cut gaps and hardness of directed cut problems.	STOC	2007	DBLP DOI BibTeX RDF	concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow
44	Lisa Fleischer	Universally Maximum Flow with Piecewise-Constant Capacities.	IPCO	1999	DBLP DOI BibTeX RDF
42	Joseph Cheriyan, Torben Hagerup	A Randomized Maximum-Flow Algorithm	FOCS	1989	DBLP DOI BibTeX RDF	dynamic trees data structure, randomized maximum-flow algorithm, prudent linking excess diminishing, negligible probability, maximum flow excess, PLED algorithm, parameter, worst case, vertex
41	Douglas S. Altner, Özlem Ergun	Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts.	CPAIOR	2008	DBLP DOI BibTeX RDF	Reoptimization, Robust Minimum Cut, Maximum Flow
38	Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton	Fast Minimum-Register Retiming via Binary Maximum-Flow.	FMCAD	2007	DBLP DOI BibTeX RDF	Sequential Verification, Retiming, Maximum Flow, State Minimization
38	Joseph S. B. Mitchell	On Maximum Flows in Polyhedral Domains.	SCG	1988	DBLP DOI BibTeX RDF
36	Noriko Imafuji, Masaru Kitsuregawa	Effects of maximum flow algorithm on identifying web community.	WIDM	2002	DBLP DOI BibTeX RDF	maximum-flow algorithm, web graph, web community
36	Sébastien Roy	Stereo Without Epipolar Lines: A Maximum-Flow Formulation.	Int. J. Comput. Vis.	1999	DBLP DOI BibTeX RDF	maximum-flow, stereo correspondence, multiple cameras, 3-d reconstruction, range estimation
36	Julia Chuzhoy, Sanjeev Khanna	Polynomial flow-cut gaps and hardness of directed cut problems.	J. ACM	2009	DBLP DOI BibTeX RDF	Directed multicut, hardness of approximation, sparsest cut
35	Austin Armbruster, Michael R. Gosnell, Bruce M. McMillin, Mariesa L. Crow	Power Transmission Control Using Distributed Max Flow.	COMPSAC (1)	2005	DBLP DOI BibTeX RDF	FT Algorithms, FT Communication, Fault Injection, maximum flow, power system
35	Dorit S. Hochbaum	The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem.	IPCO	1998	DBLP DOI BibTeX RDF
33	Chun-Gi Lyuh, Taewhan Kim	High-level synthesis for low power based on network flow method.	IEEE Trans. Very Large Scale Integr. Syst.	2003	DBLP DOI BibTeX RDF
31	Longcheng Liu, Jianzhong Zhang 0001	Inverse maximum flow problems under the weighted Hamming distance.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Inverse problems, Hamming distance, Maximum flow, Strongly polynomial algorithms
31	Robert Endre Tarjan, Julie Ward, Bin Zhang 0004, Yunhong Zhou, Jia Mao	Balancing Applied to Maximum Network Flow Problems.	ESA	2006	DBLP DOI BibTeX RDF
31	K. Srinathan, Pranava R. Goundan, M. V. N. Ashwin Kumar, R. Nandakumar, C. Pandu Rangan	Theory of Equal-Flows in Networks.	COCOON	2002	DBLP DOI BibTeX RDF
31	Samuel I. Daitch, Daniel A. Spielman	Faster approximate lossy generalized flow via interior point algorithms.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, linear programming, network flows, interior-point algorithms
29	Nadine Baumann, Ekkehard Köhler	Approximating Earliest Arrival Flows with Flow-Dependent Transit Times.	MFCS	2004	DBLP DOI BibTeX RDF
27	Xiaoyu Ji 0002, Lixing Yang, Zhen Shao	Chance Constrained Maximum Flow Problem with Fuzzy Arc Capacities.	ICIC (2)	2006	DBLP DOI BibTeX RDF
27	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
26	Andrew V. Goldberg, Alexander V. Karzanov	Maximum skew-symmetric flows and matchings.	Math. Program.	2004	DBLP DOI BibTeX RDF	skew-symmetric graph, matching, network flow, b-matching
25	Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida	A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem.	Algorithmica	2002	DBLP DOI BibTeX RDF	Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure
25	Hans L. Bodlaender, Babette van Antwerpen-de Fluiter	Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two.	Algorithmica	2001	DBLP DOI BibTeX RDF	Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure
25	Pushmeet Kohli, Philip H. S. Torr	Dynamic Graph Cuts for Efficient Inference in Markov Random Fields.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	Dynamic graph cuts, st-mincut, Markov Random Fields, Energy Minimization, Video segmentation, Maximum flow
25	Thomas Erlebach, Torben Hagerup	Routing Flow Through a Strongly Connected Graph.	Algorithmica	2002	DBLP DOI BibTeX RDF	Feasible-flow problem, Strongly connected graph, Network flow, Analysis of algorithms, Depth-first search, Maximum-flow problem
25	Andrew V. Goldberg, Satish Rao	Beyond the Flow Decomposition Barrier.	FOCS	1997	DBLP DOI BibTeX RDF	flow decomposition barrier, arc lengths, Gomory-Hu tree problem, parametric flow problem, time bound, time bounds, combinatorial mathematics, maximum flow problem
25	Hongzheng Wang, Pingyi Fan, Khaled Ben Letaief	Maximum flow and network capacity of network coding for ad-hoc networks.	IEEE Trans. Wirel. Commun.	2007	DBLP DOI BibTeX RDF
25	Mateo Restrepo, David P. Williamson	A simple GAP-canceling algorithm for the generalized maximum flow problem.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 05C85, 90C35, 90B10
25	Mateo Restrepo, David P. Williamson	A simple GAP-canceling algorithm for the generalized maximum flow problem.	SODA	2006	DBLP DOI BibTeX RDF
25	Andrew V. Goldberg	Recent Developments in Maximum Flow Algorithms (Invited Lecture).	SWAT	1998	DBLP DOI BibTeX RDF
24	Xianchao Zhang 0001, Weifa Liang, Guoliang Chen 0001	Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities.	COCOON	2008	DBLP DOI BibTeX RDF
24	Bettina Klinz, Gerhard J. Woeginger	One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs.	WG	1996	DBLP DOI BibTeX RDF
23	Bao-Hong Shen, Shuiwang Ji, Jieping Ye	Mining discrete patterns via binary matrix factorization.	KDD	2009	DBLP DOI BibTeX RDF	binary matrix factorization, rank-one, regularization, integer linear program, maximum flow, minimum cut
23	Ali Pinar, Bruce Hendrickson	Improving Load Balance with Flexibly Assignable Tasks.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	flexibly assignable tasks, constrained least squares, load balancing, Parallel computing, maximum flow
23	Ying Liu 0042, Alan P. Sprague, Elliot J. Lefkowitz	Network flow for outlier detection.	ACM Southeast Regional Conference	2004	DBLP DOI BibTeX RDF	Maximum Flow Minimum Cut, data mining, graph theory, network flow, outlier detection
23	Ali Pinar, Bruce Hendrickson	Exploiting flexibly assignable work to improve load balance.	SPAA	2002	DBLP DOI BibTeX RDF	algorithms, load balancing, parallel computing, least squares, maximum-flow
23	Zhenyu Wu, Richard M. Leahy	An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	optimal graph theoretic approach, undirected adjacency graph, arc capacities, mutually exclusive subgraphs, largest inter-subgraph maximum flow minimization, flow and cut equivalent tree partitioning, subgraph condensation, partially equivalent tree, region boundary location, closed edge contours, pattern recognition, image segmentation, image segmentation, graph theory, data clustering, minimax techniques
23	Fábio Hernandes, María T. Lamata, Marcia Tomie Takahashi, Akebo Yamakami, José L. Verdegay	An Algorithm for the Fuzzy Maximum Flow Problem.	FUZZ-IEEE	2007	DBLP DOI BibTeX RDF
23	Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn	Can A Maximum Flow be Computed on o(nm) Time?	ICALP	1990	DBLP DOI BibTeX RDF
22	Glencora Borradaile	Planar Maximum Flow - Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs.	Encyclopedia of Algorithms	2016	DBLP DOI BibTeX RDF
22	Masatoshi Sato, Hisashi Aomori, Mamoru Tanaka	Maximum-Flow Neural Network: A Novel Neural Network for the Maximum Flow Problem.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2009	DBLP DOI BibTeX RDF
21	April Rasala, Clifford Stein 0001, Eric Torng, Patchrawat Uthaisombut	Existence theorems, lower bounds and algorithms for scheduling to meet two objectives.	SODA	2002	DBLP BibTeX RDF
21	Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd	Non-Interfering Network Flows.	SWAT	1992	DBLP DOI BibTeX RDF
21	Jong-Hyuk Lee, Sung-Ho Chin, Hwa-Min Lee, TaeMyoung Yoon, Kwang-Sik Chung, Heon-Chang Yu	Adaptive Workflow Scheduling Strategy in Service-Based Grids.	GPC	2007	DBLP DOI BibTeX RDF	adaptive grid scheduling, workflow, maximum flow
21	Ning Zhang 0023, Ling Guan	Graph Cuts in Content-Based Image Classification and Retrieval with Relevance Feedback.	PCM	2007	DBLP DOI BibTeX RDF	Maximum-flow/minimum-cut, Relevance Feedback, Content-based Image Retrieval, Radial Basis Function, Graph Cuts
21	Prathima Agrawal, Antony Ng	Computing Network Flow on a Multiple Processor Pipeline.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	multiple processor pipeline, Goldberg-Tarjan algorithm, network graph, six processors, distributed algorithms, graph theory, network flow, pipeline processing, parallel implementations, performance estimates, maximum flow, partitioned algorithm, message-passing multicomputer
20	Haim Kaplan, Yahav Nussbaum	Maximum Flow in Directed Planar Graphs with Vertex Capacities.	ESA	2009	DBLP DOI BibTeX RDF
20	Bo Hong	A lock-free multi-threaded algorithm for the maximum flow problem.	IPDPS	2008	DBLP DOI BibTeX RDF
20	Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen	Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint.	SWAT	2008	DBLP DOI BibTeX RDF
20	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
20	Noriko Imafuji, Masaru Kitsuregawa	Finding a Web Community by Maximum Flow Algorithm with HITS Score Based Capacity.	DASFAA	2003	DBLP DOI BibTeX RDF
20	Franz-Josef Brandenburg, Mao-cheng Cai	Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.	FAW	2009	DBLP DOI BibTeX RDF	extended networks, lossy and gainy arcs, max-flow, unit-loss networks, shortest path, NP-hard
20	Timothy X. Brown, Harold N. Gabow, Qi Zhang	Maximum flow-life curve for a wireless ad hoc network.	MobiHoc	2001	DBLP DOI BibTeX RDF
20	Andrew V. Goldberg, Robert Endre Tarjan	A new approach to the maximum-flow problem.	J. ACM	1988	DBLP DOI BibTeX RDF
19	Jianxiu Hao, James B. Orlin	A Faster Algorithm for Finding the Minimum Cut in a Graph.	SODA	1992	DBLP BibTeX RDF
19	Maren Martens, Martin Skutella	Flows with Unit Path Capacities and Related Packing and Covering Problems.	COCOA	2008	DBLP DOI BibTeX RDF
19	Maren Martens, Martin Skutella	Length-Bounded and Dynamic k-Splittable Flows.	OR	2005	DBLP DOI BibTeX RDF
18	Michel Minoux	On robust maximum flow with polyhedral uncertainty sets.	Optim. Lett.	2009	DBLP DOI BibTeX RDF
18	Jingling Xue, Jens Knoop	A Fresh Look at PRE as a Maximum Flow Problem.	CC	2006	DBLP DOI BibTeX RDF
18	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
17	Manoj Gupta 0002, Shahbaz Khan 0004	Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching.	SOSA	2021	DBLP DOI BibTeX RDF
17	Sungjin Im, Maxim Sviridenko	Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling.	CoRR	2013	DBLP BibTeX RDF
17	Eddie Hung, Al-Shahna Jamal, Steven J. E. Wilton	Maximum flow algorithms for maximum observability during FPGA debug.	FPT	2013	DBLP DOI BibTeX RDF
17	Laszlo Marak	Segmentation d'images par l'algorithme des flot maximum continu. (On continuous maximum flow image segmentation algorithm).		2012	RDF
17	Chia-Cheng Hu, Yu-Liang Kuo, Chun-Yuan Chiu, Yueh-Min Huang	Maximum bandwidth routing and maximum flow routing in wireless mesh networks.	Telecommun. Syst.	2010	DBLP DOI BibTeX RDF
17	Donald Goldfarb, Jianxiu Hao	On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem.	Discret. Appl. Math.	1993	DBLP DOI BibTeX RDF
17	Artur Czumaj, Chris Riley, Christian Scheideler	Perfectly Balanced Allocation.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
17	Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan	Maximum Bipartite Flow in Networks with Adaptive Channel Width.	ICALP (2)	2009	DBLP DOI BibTeX RDF
17	Jan M. Hochstein, Karsten Weihe	Maximum s-t-flow with k crossings in O(k3n log n) time.	SODA	2007	DBLP BibTeX RDF
17	Wing Shing Wong	Power Control and Maximum Flows of Wireless Lattice Networks.	ICCCN	2007	DBLP DOI BibTeX RDF
17	Yi-Kuei Lin	Reliability of a Flow Network Subject to Budget Constraints.	IEEE Trans. Reliab.	2007	DBLP DOI BibTeX RDF
17	Xiaoxun Sun, Qizhi Fang	Core Stability of Flow Games.	CJCDGCGT	2005	DBLP DOI BibTeX RDF
16	Saeed Alaei, Ravi Kumar 0001, Azarakhsh Malekian, Erik Vee	Balanced allocation with succinct representation.	KDD	2010	DBLP DOI BibTeX RDF	balanced allocation, convex flow, maximum flow
16	Glencora Borradaile, Philip N. Klein	An O(n log n) algorithm for maximum st-flow in a directed planar graph.	J. ACM	2009	DBLP DOI BibTeX RDF	planar graphs, Maximum flow
16	Ahmed Redha Mahlous, Brahim Chaourar, Mahmoud Mansour	Performance Evaluation of Max Flow Multipath Protocol with Congestion Awareness.	AINA Workshops	2009	DBLP DOI BibTeX RDF	Disjoint, congestion and throughput, delay, shortest path, bandwidth, multipath, Maximum flow
16	Natalia V. Shakhlevich, Vitaly A. Strusevich	Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times.	Algorithmica	2008	DBLP DOI BibTeX RDF	Uniform parallel machine scheduling, Generalized polymatroid, Maximum flow, Controllable processing times
16	Mao-cheng Cai, Qizhi Fang	Restricted Core Stability of Flow Games.	WINE	2008	DBLP DOI BibTeX RDF	Flow game, stability, core, maximum flow, minimum cut
16	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
16	Lin Liu 0004, Yuanyuan Yang 0001	Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion.	ANCS	2007	DBLP DOI BibTeX RDF	WDM optical switches, minimum cost maximum flow, output-queued (OQ), packet scheduling, wavelength conversion
16	Marie-Christine Costa, Fethi Jarray, Christophe Picouleau	An acyclic days-off scheduling problem.	4OR	2006	DBLP DOI BibTeX RDF	Workforce scheduling, acyclic scheduling, polynomial time algorithm, maximum flow, discrete tomography
16	Fethi Jarray	Solving problems of discrete tomography.	4OR	2005	DBLP DOI BibTeX RDF	workforce scheduling, image reconstruction, polynomial time algorithm, maximum flow, Discrete tomography
16	Hua Xiang 0001, Xiaoping Tang, Martin D. F. Wong	An algorithm for integrated pin assignment and buffer planning.	ACM Trans. Design Autom. Electr. Syst.	2005	DBLP DOI BibTeX RDF	min-cost maximum flow, Buffer insertion, pin assignment
16	Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura	Partitioning of Web graphs by community topology.	WWW	2005	DBLP DOI BibTeX RDF	maximum flow algorithm, graph partitioning, Web community
16	Mao-cheng Cai, Xiaotie Deng, Lusheng Wang 0001	Minimum k Arborescences with Bandwidth Constraints.	Algorithmica	2004	DBLP DOI BibTeX RDF	Arborescence, Polymatroid intersection, Algorithm and complexity, Maximum flow, Matroid, Digraph, Polymatroid
16	Xueyan Tang, Samuel T. Chanson	Minimal Cost Replication of Dynamic Web Contents under Flat Update Delivery.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF	dynamic Web contents, maximum flow/minimum cut, Data replication, data consistency, object dependency, flow network
16	Vladimir Kolmogorov, Ramin Zabih	What Energy Functions Can Be Minimized via Graph Cuts?	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	optimization, Markov Random Fields, graph algorithms, Energy minimization, maximum flow, minimum cut
16	Hiroshi Ishikawa 0002	Exact Optimization for Markov Random Fields with Convex Priors.	IEEE Trans. Pattern Anal. Mach. Intell.	2003	DBLP DOI BibTeX RDF	global optimization, Markov random field, maximum flow, minimum cut
16	Hua Xiang 0001, D. F. Wong 0001, Xiaoping Tang	An algorithm for integrated pin assignment and buffer planning.	DAC	2002	DBLP DOI BibTeX RDF	min-cost maximum flow, buffer insertion, pin assignment
16	Yuri Boykov, Olga Veksler, Ramin Zabih	Fast Approximate Energy Minimization via Graph Cuts.	IEEE Trans. Pattern Anal. Mach. Intell.	2001	DBLP DOI BibTeX RDF	multiway cut, Markov Random Fields, graph algorithms, image restoration, motion, stereo, Energy minimization, maximum flow, minimum cut, early vision, Potts model
16	Pao-Yuan Chang, Deng-Jyi Chen, Krishna M. Kavi	Multimedia File Allocation on VC Networks Using Multipath Routing.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	linear programming, branch and bound, maximum flow, cut, virtual circuit, File allocation
16	Frank Thomson Leighton, Satish Rao	Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.	J. ACM	1999	DBLP DOI BibTeX RDF	muticommocity flow, routing, approximation algorithms, graph partitioning, divide and conquer, VLSI layout, maximum flow, minimum cut, graph bisection
16	Jon M. Kleinberg, Yuval Rabani, Éva Tardos	Fairness in Routing and Load Balancing.	FOCS	1999	DBLP DOI BibTeX RDF	load balancing, Network routing, bandwidth allocation, maximum flow, max-min fairness, unsplittable flow
16	Wing Ning Li	An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization.	SAC	1995	DBLP DOI BibTeX RDF	vertex-disjoint path, algorithm, graph, synthesis, timing optimization, maximum flow, cutset
16	Karsten Weihe	Maximum (s, t)-Flows in Planar Networks in O(\|V\| log \|V\|) Time	FOCS	1994	DBLP DOI BibTeX RDF	planar networks, maximum (s,t)-flows, directed graphs, planar graph, tree data structures, maximum flow
16	Sub Ramakrishnan, Larry A. Dunning, Thomas Nitsch	An Integrated Optimal Task Assignment Policy.	SAC	1993	DBLP DOI BibTeX RDF	scheduling, load balancing, distributed computing, maximum flow
16	Edith Cohen	Approximate Max Flow on Small Depth Networks	FOCS	1992	DBLP DOI BibTeX RDF	resource bounds, small depth networks, directed acyclic networks, fractional valued flow augmentations, fractional flow, polylogarithmic time, parallel algorithms, geometry, deterministic algorithm, NC algorithm, maximum flow problem
16	Huzur Saran, Vijay V. Vazirani	Finding k-cuts within Twice the Optimal	FOCS	1991	DBLP DOI BibTeX RDF	maximum flow computations, minimum k-cut problem, approximation algorithms, weight
16	Gary L. Miller, Joseph Naor	Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	multiple sources, planar network, exclusive-read-exclusive-write parallel random-access machine, edge capacities, lower bounds, time complexity, planar graphs, upper bounds, face, maximum flow, EREW PRAM, demand, sinks