Optimizing Resource Allocation in the Edge: A Minimum Weighted Vertex Cover Approach.

Antonios Makris Emmanouil Maragkoudakis Ioannis Kontopoulos Theodoros Theodoropoulos Ioannis Korontanis Emanuele Carlini Matteo Mordacchini Patrizio Dazzi Theodora A. Varvarigou

Published 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