Simple linear time approximation algorithm for betweenness
type: Item
instance of: scholarly article
title: Simple linear time approximation algorithm for betweenness
zbMATH Open document ID: 1258.90098
author: Yury Makarychev
published in: Operations Research Letters
publication date: 2013-03-05T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6141221
zbMATH Keywords: Betweenness problem
zbMATH Keywords: approximation algorithm
zbMATH Keywords: linear time algorithm
Wikidata QID: Q56486200
MaRDI profile type: Publication
full work available at URL: j.orl.2012.08.008
OpenAlex ID: W2027717506
cites work: A Geometric Approach to Betweenness
cites work: Total Ordering Problem
DOI: 10.1016/J.ORL.2012.08.008
Recommended article: Q4796178
Recommended article: Linear-time graph distance and diameter approximation
Recommended article: A Practical Shortest Path Algorithm with Linear Expected Time
Recommended article: A Linear Time Algorithm for Determining Almost Bipartite Graphs
Recommended article: Approximating the Metric TSP in Linear Time
Recommended article: Approximating the metric TSP in linear time
Recommended article: STACS 2004
Recommended article: Simpler computation of single-source shortest paths in linear average time
Recommended article: Q6059171
Recommended article: Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
description: scientific article; zbMATH DE number 6141221