A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (Q3725872): 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.1137/0607039
@@ Property / full work available at URL: https://doi.org/10.1137/0607039 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2053658161
@@ Property / OpenAlex ID: W2053658161 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced matrices
@@ Property / cites work: Balanced matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133404
@@ Property / cites work: Q4133404 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4194994
@@ Property / cites work: Q4194994 / rank @@
+Normal rank
@@ Property / cites work @@
+Totally-Balanced and Greedy Matrices
@@ Property / cites work: Totally-Balanced and Greedy Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+The distance-domination numbers of trees
@@ Property / cites work: The distance-domination numbers of trees / rank @@
+Normal rank
@@ Property / cites work @@
+A General Algorithm for the Optimal Distribution of Effort
+Normal rank
@@ Property / cites work @@
+Solving covering problems and the uncapacitated plant location problem on trees
+Normal rank
@@ Property / cites work @@
+Q3971521
@@ Property / cites work: Q3971521 / rank @@
+Normal rank
@@ Property / cites work @@
+The Maximum Coverage Location Problem
@@ Property / cites work: The Maximum Coverage Location Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Class of Balanced Matrices Arising from Location Problems
+Normal rank