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...
Uloženo v:
| Vydáno v: | Journal of combinatorial optimization Ročník 34; číslo 1; s. 203 - 217 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Springer US
01.07.2017
Springer Nature B.V |
| Témata: | |
| ISSN: | 1382-6905, 1573-2886 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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
). |
|---|---|
| Bibliografie: | 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 |