Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1595088992 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0911.2214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of fully dense problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling and approximation of MAX-CSP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast FAST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of minimum constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Betweenness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick approximation to matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Betweenness parameterized above tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Ordering Problem / rank
 
Normal rank

Latest revision as of 10:18, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems
scientific article

    Statements

    Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (English)
    0 references
    0 references
    0 references
    17 August 2011
    0 references
    0 references
    0 references
    0 references