A faster strongly polynomial time algorithm to solve the minimum cost tension problem

This paper presents a strongly polynomial time algorithm for the minimum cost tension problem, which runs in O ( max { m 3 n , m 2 log n ( m + n log n ) } ) time, where n and m denote the number of nodes and number of arcs, respectively. Our algorithm improves upon the previous strongly polynomial t...

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial optimization Vol. 34; no. 1; pp. 203 - 217
Main Author: Ghiyasvand, Mehdi
Format: Journal Article
Language:English
Published: New York Springer US 01.07.2017
Springer Nature B.V
Subjects:
Algorithms
Combinatorics
Convex and Discrete Geometry
Cost engineering
Graph algorithms
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Minimum cost
Operations Research/Decision Theory
Optimization
Theory of Computation
Traveling salesman problem
Tension problems
The minimum cost tension problem
Strongly polynomial time
ISSN:1382-6905, 1573-2886
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a strongly polynomial time algorithm for the minimum cost tension problem, which runs in O ( max { m 3 n , m 2 log n ( m + n log n ) } ) time, where n and m denote the number of nodes and number of arcs, respectively. Our algorithm improves upon the previous strongly polynomial time of O ( n 4 m 3 log n ) due to Hadjiat and Maurras (Discret Math 165(166):377–394, 1997 ).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-016-0070-4