Cover Image

Algorithmics and Complexity of Cost-Driven Task Offloading with Submodular Optimization in Edge-Cloud Environments

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guo, Longkun, Lin, Jiawei, Xu, Xuanming, Li, Peng
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Computational Complexity Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
by: Fuchs, Marc, et al.
Published: (2025)

Real-Time Service Subscription and Adaptive Offloading Control in Vehicular Edge Computing
by: Gao, Chuanchao, et al.
Published: (2025)

On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
by: Li, Xiaorui, et al.
Published: (2024)

Model-Agnostic Approximation of Constrained Forest Problems
by: Coupette, Corinna, et al.
Published: (2024)

Improved Distributed Algorithms for Random Colorings
by: Carlson, Charlie, et al.
Published: (2023)

Asynchronous Cooperative Optimization of a Capacitated Vehicle Routing Problem Solution
by: Accorsi, Luca, et al.
Published: (2025)

Local Ratio based Real-time Job Offloading and Resource Allocation in Mobile Edge Computing
by: Gao, Chuanchao, et al.
Published: (2025)

No distributed quantum advantage for approximate graph coloring
by: Coiteux-Roy, Xavier, et al.
Published: (2023)

Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
by: Chalopin, Jérémie, et al.
Published: (2026)

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
by: Döring, Michelle
Published: (2025)

SPHERE: Spherical partitioning for large-scale routing optimization
by: Lindermann, Robert Fabian, et al.
Published: (2025)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
by: Bonamy, Marthe, et al.
Published: (2025)

Jet: Multilevel Graph Partitioning on Graphics Processing Units
by: Gilbert, Michael S., et al.
Published: (2023)

Lower bound for constant-size local certification
by: Martínez, Virgina Ardévol, et al.
Published: (2022)

Convergence Sans Synchronization
by: Gupta, Arya Tanmay
Published: (2025)

Efficient Computation in Congested Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2023)

3-Majority and 2-Choices with Many Opinions
by: Shimizu, Nobutaka, et al.
Published: (2025)

Optimal Computation in Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2022)

Learning-Based Approaches for Job Shop Scheduling Problems: A Review
by: Rihane, Karima, et al.
Published: (2025)

Non-trivial automata networks do exist that solve the global majority problem with the local majority rule
by: Balbi, Pedro Paulo, et al.
Published: (2026)

Efficient Approximation of Centrality Measures in Uncertain Graphs
by: Ketels, Daniel
Published: (2024)

Asynchronous 3-Majority Dynamics with Many Opinions
by: Cooper, Colin, et al.
Published: (2024)

Edge Generation Scheduling for DAG Tasks Using Deep Reinforcement Learning
by: Sun, Binqi, et al.
Published: (2023)

Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally
by: Bok, Jan, et al.
Published: (2025)

Optimal Multilevel Slashing for Blockchains
by: Wood, Kenan, et al.
Published: (2024)

Decompose, Optimize, and Reconstruct: Very Large Constant Multiplication at Scale
by: Cantaloube, Théo, et al.
Published: (2026)

Efficient Parallel $(Δ+1)$-Edge-Coloring
by: Elkin, Michael, et al.
Published: (2026)

Complexity landscape for local certification
by: Bousquet, Nicolas, et al.
Published: (2025)

Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
by: Chang, Yen-Hsiang, et al.
Published: (2025)

Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
by: Fuchs, Marc, et al.
Published: (2024)

SUperman: Efficient Permanent Computation on GPUs
by: Elbek, Deniz, et al.
Published: (2025)

Variant Codes Based on A Special Polynomial Ring and Their Fast Computations
by: Yu, Leilei, et al.
Published: (2023)

Causal Graph Dynamics and Kan Extensions
by: Maignan, Luidnel, et al.
Published: (2024)

Network Centrality as a New Perspective on Microservice Architecture
by: Bakhtin, Alexander, et al.
Published: (2025)

A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs
by: Zhu, Hongyu, et al.
Published: (2022)

Fully-Automated Code Generation for Efficient Computation of Sparse Matrix Permanents on GPUs
by: Elbek, Deniz, et al.
Published: (2025)

A Review on Message Complexity of the Algorithms for Clock Synchronization in Distributed Systems
by: Dissanayake, Chandeepa, et al.
Published: (2024)

Local certification of geometric graph classes
by: Defrain, Oscar, et al.
Published: (2023)

Renaming in distributed certification
by: Bousquet, Nicolas, et al.
Published: (2024)

Local certification of forbidden subgraphs
by: Bousquet, Nicolas, et al.
Published: (2024)