Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A tight lower bound for the train reversal problem

From MaRDI portal
Publication:912613
Jump to:navigation, search

DOI10.1016/0020-0190(90)90032-SzbMath0698.68038OpenAlexW2069292501MaRDI QIDQ912613

Alok Aggarwal, Leighton, Tom

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90032-s


zbMATH Keywords

upper boundlower boundone car spurrecusive algorithmreversing a train


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)




Cites Work

  • Reversing trains: A turn of the century sorting problem
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:912613&oldid=12880221"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki