Image de couverture de livre

Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Chen, Chi-Yeh
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
par: Chen, Chi-Yeh
Publié: (2025)

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
par: Chen, Chi-Yeh
Publié: (2025)

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling
par: Zhao, Jingyang, et autres
Publié: (2025)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
par: Sinhal, Anay, et autres
Publié: (2026)

Approximation Algorithms for Fair Repetitive Scheduling
par: Hermelin, Danny, et autres
Publié: (2025)

Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
par: Li, Shi
Publié: (2024)

An Empirical Study of Online Packet Scheduling Algorithms
par: Sakr, Nourhan, et autres
Publié: (2016)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
par: Das, Rathish, et autres
Publié: (2025)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
par: Grus, Josef, et autres
Publié: (2024)

An Improved Pseudopolynomial Time Algorithm for Subset Sum
par: Chen, Lin, et autres
Publié: (2024)

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring
par: Ferber, Asaf, et autres
Publié: (2025)

New Convex Programming Technique for Nash Social Welfare and Scheduling
par: Feng, Yuda, et autres
Publié: (2026)

Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines
par: Hertrich, Christoph, et autres
Publié: (2020)

Temporal Routing in Static Networks: The Schedule Completion Problem
par: Döring, Michelle, et autres
Publié: (2026)

Improved Additive Approximation Algorithms for APSP
par: Jin, Ce, et autres
Publié: (2025)

An Improved Algorithm for Sparse Instances of SAT
par: Jain, Sanjay, et autres
Publié: (2024)

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
par: Bringmann, Karl, et autres
Publié: (2026)

A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
par: Singh, Rajpreet, et autres
Publié: (2025)

Improved Algorithms for Clustering with Noisy Distance Oracles
par: Pradhan, Pinki, et autres
Publié: (2026)

Improved Approximation Algorithm for Maximum Balanced Biclique
par: Manurangsi, Pasin
Publié: (2026)

Improved Algorithms for Fair Matroid Submodular Maximization
par: Mahabadi, Sepideh, et autres
Publié: (2026)

Improved Approximation Algorithms for Three-Dimensional Knapsack
par: Jansen, Klaus, et autres
Publié: (2025)

An Improved Approximation Algorithm for Metric Triangle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

Improved Algorithms for Effective Resistance Computation on Graphs
par: Yang, Yichun, et autres
Publié: (2025)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
par: Mendoza-Cadena, Mirabel, et autres
Publié: (2026)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
par: Armbruster, Alexander, et autres
Publié: (2026)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Improved Kernelization and Fixed-parameter Algorithms for Bicluster Editing
par: Lafond, Manuel
Publié: (2024)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
par: Liu, Yuxi, et autres
Publié: (2023)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
par: Zhu, Yanhui, et autres
Publié: (2024)

Streaming Algorithms for Network Design
par: Chekuri, Chandra, et autres
Publié: (2025)

Optimizing Age-of-Information in Piggyback Networks with Recurrent Data Generation
par: Lin, Ching-Chi, et autres
Publié: (2025)

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
par: Bansal, Nikhil, et autres
Publié: (2026)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
par: Zhao, Jingyang, et autres
Publié: (2022)

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
par: Gawrychowski, Paweł, et autres
Publié: (2024)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
par: Zhao, Jingyang, et autres
Publié: (2025)

Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering
par: Fan, Chenglin, et autres
Publié: (2025)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
par: Hsieh, Yi-Ting, et autres
Publié: (2025)

Broadcasting in Heterogeneous Tree Networks with Edge Weight Uncertainty
par: Tsou, Cheng-Hsiao, et autres
Publié: (2024)