Cut problems in graphs with a budget constraint (Q2457298): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2006.05.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2037387767
@@ Property / OpenAlex ID: W2037387767 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm of MULTIWAY CUT.
+Normal rank
@@ Property / cites work @@
+Rounding algorithms for a geometric embedding of minimum multiway cut
+Normal rank
@@ Property / cites work @@
+Increasing the Weight of Minimum Spanning Trees
@@ Property / cites work: Increasing the Weight of Minimum Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
+Normal rank
@@ Property / cites work @@
+The geometry of graphs and some of its algorithmic applications
+Normal rank
@@ Property / cites work @@
+Euclidean distortion and the sparsest cut
@@ Property / cites work: Euclidean distortion and the sparsest cut / rank @@
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-Terminal Network Flows
@@ Property / cites work: Multi-Terminal Network Flows / 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 @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+Q4449246
@@ Property / cites work: Q4449246 / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic analysis of the maximal covering location problem
+Normal rank
@@ Property / cites work @@
+Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
+Normal rank
@@ Property / cites work @@
+A note on maximizing a submodular set function subject to a knapsack constraint
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank