Algorithms and Computation

DOI10.1007/11602613zbMath1175.68549arXiv1407.1910OpenAlexW2304246803MaRDI QIDQ5897928

Seth Pettie

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.1910

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (15)

A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges ⋮ A Faster Computation of All the Best Swap Edges of a Tree Spanner ⋮ Linear-Time Approximation for Maximum Weight Matching ⋮ The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems ⋮ A faster computation of all the best swap edges of a shortest paths tree ⋮ Balancing of simple assembly lines under variations of task processing times ⋮ Finding best swap edges minimizing the routing cost of a spanning tree ⋮ Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance ⋮ An improved algorithm for computing all the best swap edges of a tree spanner ⋮ Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem ⋮ Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm ⋮ A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners ⋮ Stability of Networks in Stretchable Graphs ⋮ Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems ⋮ An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner

This page was built for publication: Algorithms and Computation