An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem

DOI10.1007/978-3-540-74839-7_16zbMath1141.68546OpenAlexW1568259354MaRDI QIDQ3508564

Paolo Penna, Angelo Monti, Riccardo Silvestri

Publication date: 1 July 2008

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74839-7_16

zbMATH Keywords

competitive analysisCaccetta-Häggkvist conjectureonline load balancing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Total domination and the Caccetta-Häggkvist conjecture ⋮ An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem

Cites Work

• Unnamed Item
• On-line load balancing made simple: greedy strikes back
• Directed triangles in digraphs
• On-line load balancing
• On the Caccetta-Häggkvist conjecture
• On-Line Load Balancing in a Hierarchical Server Topology
• On-Line Load Balancing of Temporary Tasks
• Edge-Disjoint Spanning Trees of Finite Graphs
• An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
• On minimal regular digraphs with given girth

This page was built for publication: An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem