Finding mobile data under delay constraints with searching costs

DOI10.1145/1835698.1835774zbMath1315.68285OpenAlexW2113902966MaRDI QIDQ5176206

Yi Feng, Panagiotis Cheilaris, Asaf Levin, Amotz Bar-Noy

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1835698.1835774

zbMATH Keywords

partitioningschedulingapproximation algorithmsdesign and analysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: Finding mobile data under delay constraints with searching costs