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

DOI10.1007/978-3-540-74839-7_16MaRDI QIDQ3508564zbMATH OpenOpenAlexFDO

Authors Angelo Monti, Paolo Penna, 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 analysisonline load balancingCaccetta-Häggkvist conjecture

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6263412
• On the Caccetta-Häggkvist conjecture
• Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
• On the Caccetta-Häggkvist conjecture with forbidden subgraphs
• On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament

Cites work

• scientific article; zbMATH DE number 3630786 (Why is no real title available?)
• An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
• Directed triangles in digraphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• On minimal regular digraphs with given girth
• On the Caccetta-Häggkvist conjecture
• On-Line Load Balancing of Temporary Tasks
• On-line load balancing
• On-line load balancing in a hierarchical server topology
• On-line load balancing made simple: greedy strikes back

Cited in

(3)

• Total domination and the Caccetta-Häggkvist conjecture
• Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
• An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem

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

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