The ferry cover problem
From MaRDI portal
Publication:2272191
DOI10.1007/S00224-008-9107-0zbMATH Open1176.90105OpenAlexW2150334609MaRDI QIDQ2272191FDOQ2272191
Authors: Michael Lampis, Valia Mitsou
Publication date: 6 August 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-008-9107-0
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Traffic problems in operations research (90B20)
Cites Work
- Title not available (Why is that?)
- Optimization, approximation, and complexity classes
- On the complexity of H-coloring
- Title not available (Why is that?)
- Primal-dual approximation algorithms for feedback problems in planar graphs
- Node-and edge-deletion NP-complete problems
- Title not available (Why is that?)
- Approximate max-flow min-(multi)cut theorems and their applications
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: The ferry cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272191)