Now showing items 1-4 of 4
| Abstract: | An antimedian of a pro le = (x1; x2; : : : ; xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the pro le. The antimedian function is de ned on the set of all pro les on G and has as output the set of antimedians of a pro le. It is a typical location function for nding a location for an obnoxious facility. The `converse' of the antimedian function is the median function, where the distance sum is minimized. The median function is well studied. For instance it has been characterized axiomatically by three simple axioms on median graphs. The median function behaves nicely on many classes of graphs. In contrast the antimedian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper such a characterization is obtained for the two classes of graphs on which the antimedian is well-behaved: paths and hypercubes. |
| Description: | Discrete Mathematics, Algorithms and Applications |
| URI: | http://dyuthi.cusat.ac.in/purl/4201 |
| Files | Size |
|---|---|
| Axiomatic Chara ... n Paths and Hypercubes.pdf | (173.6Kb) |
| Abstract: | The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for obnoxious facilities, the antimedian was studied. Here one maximizes the average distance to the clients. In this paper the mixed case is studied. Clients are represented by a profile, which is a sequence of vertices with repetitions allowed. In a signed profile each element is provided with a sign from f+; g. Thus one can take into account whether the client prefers the facility (with a + sign) or rejects it (with a sign). The graphs for which all median sets, or all antimedian sets, are connected are characterized. Various consensus strategies for signed profiles are studied, amongst which Majority, Plurality and Scarcity. Hypercubes are the only graphs on which Majority produces the median set for all signed profiles. Finally, the antimedian sets are found by the Scarcity Strategy on e.g. Hamming graphs, Johnson graphs and halfcubes |
| Description: | Ars Math. Contemp. 6 (2013) 127–145 |
| URI: | http://dyuthi.cusat.ac.in/purl/4234 |
| Files | Size |
|---|---|
| Consensus strat ... ned profiles on graphs.pdf | (315.9Kb) |
| Abstract: | Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of pro¯les. A review of algorithms for median computation on median graphs is discussed and their time complexities are compared. Implementation of the consensus strategies on median computation in arbitrary graphs is discussed |
| Description: | Report/Econometric Institute, Erasmus University Rotterdam,EI 2007-34 |
| URI: | http://dyuthi.cusat.ac.in/purl/4218 |
| Files | Size |
|---|---|
| Median computat ... g consensus strategies.pdf | (195.4Kb) |
| Abstract: | The Majority Strategy for finding medians of a set of clients on a graph can be relaxed in the following way: if we are at v, then we move to a neighbor w if there are at least as many clients closer to w than to v (thus ignoring the clients at equal distance from v and w). The graphs on which this Plurality Strategy always finds the set of all medians are precisely those for which the set of medians induces always a connected subgraph |
| Description: | Report/Econometric Institute, Erasmus University Rotterdam |
| URI: | http://dyuthi.cusat.ac.in/purl/4208 |
| Files | Size |
|---|---|
| The Plurality Strategy on Graphs.pdf | (149.0Kb) |
Now showing items 1-4 of 4
Dyuthi Digital Repository Copyright © 2007-2011 Cochin University of Science and Technology. Items in Dyuthi are protected by copyright, with all rights reserved, unless otherwise indicated.