Optimizing Resource Allocation in the Edge: A Minimum Weighted Vertex Cover Approach.
Antonios MakrisEmmanouil MaragkoudakisIoannis KontopoulosTheodoros TheodoropoulosIoannis KorontanisEmanuele CarliniMatteo MordacchiniPatrizio DazziTheodora A. VarvarigouPublished in: FRAME@HPDC (2024)
Keyphrases
- resource allocation
- vertex cover
- approximation algorithms
- weighted graph
- planar graphs
- resource allocation problems
- precedence constraints
- partial order
- undirected graph
- minimum cost
- optimality criterion
- resource allocation decisions
- scheduling problem
- constant factor
- optimal resource allocation
- edge detection
- finding optimal
- resource consumption
- resource allocation and scheduling
- special case
- allocation problems
- edge weights
- np hard
- polynomial time approximation
- partially ordered
- combinatorial auctions
- computational complexity