On condorcet and median points of simple rectilinear polygons
From MaRDI portal
Publication:5055889
DOI10.1007/3-540-60249-6_50OpenAlexW1607290969MaRDI QIDQ5055889
Victor Chepoi, Feodor F. Dragan
Publication date: 9 December 2022
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60249-6_50
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Medians in median graphs
- On rectilinear link distance
- Gated sets in metric spaces
- Networks with Condorcet solutions
- Outcomes of voting and planning in single facility location problems
- New perspectives in competitive location theory
- Triangulating a simple polygon in linear time
- Computing a median point of a simple rectilinear polygon
- Time bounds for selection
- Median algebras
- A multifacility location problem on median spaces
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Optimal Point Location in a Monotone Subdivision
- Algorithms for Voting and Competitive Location on a Network
- Optimal Search in Planar Subdivisions
- Some Generalizations of Social Decisions under Majority Rule