New approximations and hardness results for submodular partitioning problems (Q2115890): Difference between revisions

@@ Property / OpenAlex ID @@
+W3183634933
@@ Property / OpenAlex ID: W3183634933 / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607983
@@ Property / cites work: Q4607983 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Submodular Multiway Partition
+Normal rank
@@ Property / cites work @@
+Submodular Cost Allocation Problem and Applications
+Normal rank
@@ Property / cites work @@
+Q5140849
@@ Property / cites work: Q5140849 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on formulations for the \(A\)-partition problem on hypergraphs
+Normal rank
@@ Property / cites work @@
+Q2969615
@@ Property / cites work: Q2969615 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems
+Normal rank
@@ Property / cites work @@
+Maximizing Non-monotone Submodular Functions
@@ Property / cites work: Maximizing Non-monotone Submodular Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
+Normal rank
@@ Property / cites work @@
+Q4633864
@@ Property / cites work: Q4633864 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for the k-cut Problem for Fixed k
+Normal rank
@@ Property / cites work @@
+Q2921761
@@ Property / cites work: Q2921761 / rank @@
+Normal rank
@@ Property / cites work @@
+Submodular Function Minimization under Covering Constraints
+Normal rank
@@ Property / cites work @@
+A new approach to the minimum cut problem
@@ Property / cites work: A new approach to the minimum cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
+Normal rank
@@ Property / cites work @@
+Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
+Normal rank
@@ Property / cites work @@
+Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis
+Normal rank
@@ Property / cites work @@
+Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
+Normal rank
@@ Property / cites work @@
+Q5009516
@@ Property / cites work: Q5009516 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Cuts within Twice the Optimal
@@ Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank @@
+Normal rank
@@ Property / cites work @@
+Submodular Approximation: Sampling-based Algorithms and Lower Bounds
+Normal rank
@@ Property / cites work @@
+Facility location with hierarchical facility costs
+Normal rank
@@ Property / cites work @@
+Greedy splitting algorithms for approximating multiway partition problems
+Normal rank