Pages that link to "Item:Q3158558"

The following pages link to Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558):

Displayed 34 items.

• Electric routing and concurrent flow cutting (Q553348) ‎ (← links)
• Flow metrics (Q596135) ‎ (← links)
• \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) ‎ (← links)
• Minimal multicut and maximal integer multiflow: a survey (Q707131) ‎ (← links)
• On the Max-flow min-cut ratio for directed multicommodity flows (Q818146) ‎ (← links)
• A note on multiflows and treewidth (Q834591) ‎ (← links)
• Approximation algorithms for treewidth (Q848843) ‎ (← links)
• \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) ‎ (← links)
• Approximation algorithms for requirement cut on graphs (Q848961) ‎ (← links)
• The multi-multiway cut problem (Q884458) ‎ (← links)
• Algorithms for the universal and a priori TSP (Q924875) ‎ (← links)
• Most balanced minimum cuts (Q968139) ‎ (← links)
• On the complexity of finding balanced oneway cuts (Q1014383) ‎ (← links)
• An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) ‎ (← links)
• Sparsest cuts and concurrent flows in product graphs. (Q1427176) ‎ (← links)
• On treewidth approximations. (Q1427177) ‎ (← links)
• Crossing number, pair-crossing number, and expansion (Q1880792) ‎ (← links)
• Feedback arc set problem in bipartite tournaments (Q2380064) ‎ (← links)
• Polynomiality of sparsest cuts with fixed number of sources (Q2467444) ‎ (← links)
• On certain connectivity properties of the internet topology (Q2490261) ‎ (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) ‎ (← links)
• Meet and merge: approximation algorithms for confluent flows (Q2495396) ‎ (← links)
• Correlation clustering in general weighted graphs (Q2503347) ‎ (← links)
• Inoculation strategies for victims of viruses and the sum-of-squares partition problem (Q2507699) ‎ (← links)
• Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs (Q2573422) ‎ (← links)
• The Complexity Status of Problems Related to Sparsest Cuts (Q3000501) ‎ (← links)
• A Separator Theorem for String Graphs and its Applications (Q3058296) ‎ (← links)
• Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions (Q3088104) ‎ (← links)
• Linear time algorithms for finding sparsest cuts in various graph classes (Q3439593) ‎ (← links)
• Expander graphs and their applications (Q3514498) ‎ (← links)
• EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS (Q4818598) ‎ (← links)
• Euclidean distortion and the sparsest cut (Q5423920) ‎ (← links)
• A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES (Q5696959) ‎ (← links)
• A decentralized algorithm for spectral analysis (Q5920385) ‎ (← links)