On Mobile Robots Flow In Locally Uniform Networks

DOI10.1080/03155986.1997.11732337MaRDI QIDQ4380544zbMATH OpenOpenAlexFDO

Authors Michal Penn, David Sinreich, Zeev Nutov

Publication date 17 March 1998

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1997.11732337

zbMATH Keywords

approximation algorithmblockingcongestionconnectivitymobile robot flow networkNP-hard

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Production models (90B30)

Recommendations

• Designing multi-commodity flow trees
• On the approximability of robust network design
• Designing multi-commodity flow trees
• Meet and merge: approximation algorithms for confluent flows

This page was built for publication: On Mobile Robots Flow In Locally Uniform Networks

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