Search results for "arc capacities"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Xiaoyu Ji, Lixing Yang, Zhen Shao	Chance Constrained Maximum Flow Problem with Fuzzy Arc Capacities.	ICIC	2006	DBLP DOI BibTeX RDF
2	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
1	Tao Zhang, Bo Guo, Yuejin Tan	Reliability-Based Route Optimization of a Transportation Network with Random Arc Capacities and Time Threshold.	IUKM	2011	DBLP DOI BibTeX RDF
1	Daniel Dressler, Martin Skutella	An FPTAS for Flows over Time with Aggregate Arc Capacities.	WAOA	2010	DBLP DOI BibTeX RDF
1	Maren Martens	A Simple Greedy Algorithm for the k-Disjoint Flow Problem.	TAMC	2009	DBLP DOI BibTeX RDF
1	Hande Yaman	Star p-hub median problem with modular arc capacities.	Computers & OR	2008	DBLP DOI BibTeX RDF
1	Maxim A. Babenko, Alexander V. Karzanov	A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem.	ESA	2008	DBLP DOI BibTeX RDF
1	Vardges Melkonian	Flows in dynamic networks with aggregate arc capacities.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
1	Ning Shi, Raymond K. Cheung, Haiqing Song	On stochastic programs over trees with partially dependent arc capacities.	Networks	2007	DBLP DOI BibTeX RDF
1	Maria Grazia Scutellà	A note on the parametric maximum flow problem and some related reoptimization issues.	Annals OR	2007	DBLP DOI BibTeX RDF	Parametric arc capacity, Maximum flow
1	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
1	Krzysztof Walkowiak	New Algorithms for the Unsplittable Flow Problem.	ICCSA	2006	DBLP DOI BibTeX RDF	UFP, survivability, connection-oriented network
1	Krzysztof Walkowiak	Unsplittable Anycast Flow Problem: Formulation and Algorithms.	International Conference on Computational Science	2006	DBLP DOI BibTeX RDF	UFP, anycast, connection-oriented network
1	Hande Yaman	Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities.	SIAM J. Discrete Math.	2005	DBLP DOI BibTeX RDF
1	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
1	Maren Martens, Martin Skutella	Length-Bounded and Dynamic k-Splittable Flows.	OR	2005	DBLP DOI BibTeX RDF
1	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
1	Andrew V. Goldberg, Satish Rao	Beyond the Flow Decomposition Barrier.	J. ACM	1998	DBLP DOI BibTeX RDF	combinatorial optimization, maximum flows
1	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
1	Anthony Vannelli	An adaptation of the interior point method for solving the global routing problem.	IEEE Trans. on CAD of Integrated Circuits and Systems	1991	DBLP DOI BibTeX RDF