The weighted sitting closer to friends than enemies problem in the line

Julio Aracena () and Christopher Thraves Caro ()
Additional contact information
Julio Aracena: Universidad de Concepción
Christopher Thraves Caro: Univiversidad de Concepción

Journal of Combinatorial Optimization, 2023, vol. 45, issue 1, No 27, 21 pages

Abstract: Abstract The weighted Sitting Closer to Friends than Enemies (SCFE) problem is to find an injection of the vertex set of a given weighted graph into a given metric space so that, for every pair of incident edges with different weight, the end vertices of the heavier edge are closer than the end vertices of the lighter edge. The Seriation problem is to find a simultaneous reordering of the rows and columns of a symmetric matrix such that the entries are monotone nondecreasing in rows and columns when moving towards the diagonal. If such a reordering exists, it is called a Robinson ordering. In this work, we establish a connection between the SCFE problem and the Seriation problem. We show that if the extended adjacency matrix of a given weighted graph G has no Robinson ordering then G has no injection in $$\mathbb {R}$$ R that solves the SCFE problem. On the other hand, if the extended adjacency matrix of G has a Robinson ordering, we construct a polyhedron that is not empty if and only if there is an injection of the vertex set of G in $$\mathbb {R}$$ R that solves the SCFE problem. As a consequence of these results, we conclude that deciding the existence of (and constructing) such an injection in $$\mathbb {R}$$ R for a given complete weighted graph can be done in polynomial time. On the other hand, we show that deciding if an incomplete weighted graph has such an injection in $$\mathbb {R}$$ R is NP-Complete.

Keywords: The SCFE problem; Robinsonian matrices; Valid distance drawings; Weighted graphs; Metric spaces; Seriation problem; 05C22; 90C35; 68R10; 52B11 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00953-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00953-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00953-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().