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

The three column bandpass problem is solvable in linear time

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

DOI10.1016/J.TCS.2010.09.018zbMath1206.90149OpenAlexW1984779023MaRDI QIDQ620937

Zhong Li, Guo-Hui Lin

Publication date: 2 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.018


zbMATH Keywords

exact algorithmbandpass problempolynomial time solvable


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorial optimization (90C27)


Related Items (2)

Scatter search for the bandpass problem ⋮ The band collocation problem




Cites Work

  • The bandpass problem: Combinatorial optimization and library of problems




This page was built for publication: The three column bandpass problem is solvable in linear time

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:620937&oldid=12514414"
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 08:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki