A hypergraph ranking framework is proposed for resource allocation, but its core theorem is unproven and its approximation bound is vacuous.
Paths, trees, and flowers.Canadian Journal of Mathe- matics, 17:449–467, 1965
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
A hypergraph ranking framework is proposed for resource allocation, but its core theorem is unproven and its approximation bound is vacuous.