Pages that link to "Item:Q4371680"
From MaRDI portal
The following pages link to A new approach to the minimum cut problem (Q4371680):
Displaying 50 items.
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- An approach to the asymmetric multi-depot capacitated arc routing problem (Q319291) (← links)
- Certifying algorithms (Q465678) (← links)
- A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- A binomial approximation method for the Ising model (Q741352) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
- Minimum cost subpartitions in graphs (Q845968) (← links)
- Minimum degree orderings (Q848936) (← links)
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← links)
- A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915) (← links)
- Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
- A new technique for the link slice problem (Q1060741) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- On minimum cuts and the linear arrangement problem (Q1570828) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Robust optimization in the presence of uncertainty: a generic approach (Q1745727) (← links)
- Computing girth and cogirth in perturbed graphic matroids (Q1747998) (← links)
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
- On cutting a few vertices from a graph (Q1811082) (← links)
- Generalizing the all-pairs min cut problem (Q1910514) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- On the \(k\)-cut problem (Q1977642) (← links)
- Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs (Q1990576) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
- Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
- Tracking paths (Q2185723) (← links)
- Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (Q2462107) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
- Unbalanced graph cuts with minimum capacity (Q2515430) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Improving on best-of-many-Christofides for \(T\)-tours (Q2661569) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (Q2744651) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- An Improved Integrality Gap for Asymmetric TSP Paths (Q3186524) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- Efficient Algorithms for the k Smallest Cuts Enumeration (Q3511355) (← links)
- Minimum Cuts of Simple Graphs in Almost Always Linear Time (Q3605499) (← links)
