Lower Bounds on $0$-Extension with Steiner Nodes

In the $0$-Extension problem, we are given an edge-weighted graph $G=(V,E,c)$, a set $T\subseteq V$ of its vertices called terminals, and a semi-metric $D$ over $T$, and the goal is to find an assignment $f$ of each non-terminal vertex to a terminal, minimizing the sum, over all edges $(u,v)\in E$,...

Full description

Bibliographic Details

Main Authors:	Chen, Yu, Tan, Zihan
Format:	Journal Article
Language:	English
Published:	17-01-2024
Subjects:	Computer Science - Data Structures and Algorithms
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!