Visiting infinitely often the unit interval while minimizing the idle time of high priority segments

DOI10.1007/978-3-030-24922-9_30MaRDI QIDQ2303307zbMATH OpenOpenAlexFDO

Authors Oscar Morales-Ponce

Publication date 3 March 2020

Full work available at URL https://doi.org/10.1007/978-3-030-24922-9_30

Mathematics Subject Classification ID

Computer system organization (68Mxx) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient visit frequencies for polling tables: Minimization of waiting cost
• Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots
• LP rounding and combinatorial algorithms for minimizing active and busy time
• Problem of optimal visits to sets
• About an optimal visiting problem
• scientific article; zbMATH DE number 1294395
• Interval scheduling maximizing minimum coverage
• Randomized online algorithms for maximizing busy time interval scheduling
• Optimal interval scheduling with a resource constraint
• scientific article; zbMATH DE number 6297719

Cited in

(1)

• Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots

This page was built for publication: Visiting infinitely often the unit interval while minimizing the idle time of high priority segments

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