A geometric approach to betweenness

DOI10.1007/3-540-60313-1_146zbMath1512.68445OpenAlexW1506316869MaRDI QIDQ6102303

Benny Chor, Madhu Sudan

Publication date: 8 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60313-1_146

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Semidefinite programming (90C22) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• .879-approximation algorithms for MAX CUT and MAX 2SAT
• Total Ordering Problem
• On the Shannon capacity of a graph

This page was built for publication: A geometric approach to betweenness