A note on maximizing the minimum voter satisfaction on spanning trees (Q991324): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.mathsocsci.2010.04.003
+Normal rank
@@ Property / OpenAlex ID @@
+W3124102069
@@ Property / OpenAlex ID: W3124102069 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Min-Max (Regret) Versions of Some Polynomial Problems
+Normal rank
@@ Property / cites work @@
+On cost allocation for a spanning tree: A game theoretic approach
+Normal rank
@@ Property / cites work @@
+Sharing a minimal cost spanning tree: beyond the folk solution
+Normal rank
@@ Property / cites work @@
+Q3323629
@@ Property / cites work: Q3323629 / rank @@
+Normal rank
@@ Property / cites work @@
+Cost allocation for a spanning tree
@@ Property / cites work: Cost allocation for a spanning tree / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the minimum voter satisfaction on spanning trees
+Normal rank
@@ Property / cites work @@
+Cost monotonicity, consistency and minimum cost spanning tree games
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4802394
@@ Property / cites work: Q4802394 / rank @@
+Normal rank
@@ Property / cites work @@
+Basic Geometry of Voting
@@ Property / cites work: Basic Geometry of Voting / rank @@
+Normal rank