The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem

DOI10.1002/net.20057zbMath1168.90632OpenAlexW4251613475MaRDI QIDQ4680416

Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough

Publication date: 1 June 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20057

zbMATH Keywords

dynamic greedy algorithmon-line Steiner tree problemsequential sum problemvertex greedy algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• The Steiner tree problem
• Unnamed Item
• Unnamed Item

This page was built for publication: The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem