Complexity results for extensions of median orders to different types of remoteness (Q2348767): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-013-1342-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978225558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The median procedure in cluster analysis and social choice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation and decision models with multiple criteria. Stepping stones for the analyst. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3116854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An updated survey on the linear ordering problem for weighted or unweighted tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Kemeny elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness results for the aggregation of linear orders into median orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the complexity of tournament solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Slater's problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of median linear orders, of median complete preorders and of median weak orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus theories. An oriented survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766482 / rank
 
Normal rank

Latest revision as of 05:06, 10 July 2024

scientific article
Language Label Description Also known as
English
Complexity results for extensions of median orders to different types of remoteness
scientific article

    Statements

    Complexity results for extensions of median orders to different types of remoteness (English)
    0 references
    0 references
    15 June 2015
    0 references
    complexity
    0 references
    NP-completeness
    0 references
    aggregation of preferences
    0 references
    remoteness
    0 references
    symmetric difference distance
    0 references
    median relation
    0 references
    median order
    0 references
    binary relations
    0 references
    complete preorder
    0 references
    weak order
    0 references
    linear order
    0 references
    tournament
    0 references
    Slater's problem
    0 references
    Kemeny's problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references