A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem

Given a n points in two dimensional space, a Manhattan Network G is a network that connects all n points with either horizontal or vertical edges, with the property that for any two point in G should be connected by a Manhattan path and distance between this two points is equal to Manhattan Distance...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-03
Hauptverfasser:	Md Musfiqur Rahman Sanim, Safrunnesa Saira, Ahsan, Fatin Faiaz, Bardhan, Rajon, Ferdous, S M
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Mathematical analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!