Approximation algorithms for the Bipartite Multicut problem (Q991784): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometric algorithms and combinatorial optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4708558 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing directed circuits fractionally / rank | |||
Normal rank |
Latest revision as of 04:40, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation algorithms for the Bipartite Multicut problem |
scientific article |
Statements
Approximation algorithms for the Bipartite Multicut problem (English)
0 references
7 September 2010
0 references
approximation algorithms
0 references
Bipartite Multicut
0 references
0 references