Approximation and Online Algorithms

DOI10.1007/B106130zbMATH Open1124.90352OpenAlexW4299357393MaRDI QIDQ5713437FDOQ5713437

Authors Spyros Angelopoulos

Publication date 14 December 2005

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

Full work available at URL https://doi.org/10.1007/b106130

zbMATH Keywords

dominating setfacility locationinapproximability resultsPriority algorithms

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) General topics in the theory of algorithms (68W01)

Recommendations

• Models of greedy algorithms for graph problems
• scientific article; zbMATH DE number 6469169
• scientific article; zbMATH DE number 2119736
• (Incremental) priority algorithms
• On the Greedy Solution of Ordering Problems

Cited in

(3)

• Models of greedy algorithms for graph problems
• Priority algorithms for graph optimization problems
• A natural extension for the greedy \(\beta\)-transformation with three arbitrary digits

This page was built for publication: Approximation and Online Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713437)