Algorithms and time complexity of the request-service problem

DOI10.1007/S10878-008-9202-9MaRDI QIDQ711403zbMATH OpenOpenAlexWikidataFDO

Authors Chunmei Liu, Ajoni Blake, Legand L. Burge

Publication date 26 October 2010

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL http://europepmc.org/articles/pmc3085490

zbMATH Keywords

disjoint cycle coverMAX2SAT

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Broadcast scheduling, algorithms and complexity
• Complexity of the multi-service center problem
• Complexity of the multi-service center problem
• Algorithm for quadratic semi-assignment problem with partition size coefficients
• A simple optimal algorithm for scheduling variable-sized requests

This page was built for publication: Algorithms and time complexity of the request-service problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711403)