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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

New approximation algorithm for RTILE problem.

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

DOI10.1016/S0304-3975(02)00504-2zbMath1053.68127OpenAlexW2082111472MaRDI QIDQ1401385

Katarzyna E. Paluch, Krzysztof Loryś

Publication date: 17 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00504-2


zbMATH Keywords

Approximation algorithmsRectangle tiling


Mathematics Subject Classification ID

Approximation algorithms (68W25) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)


Related Items (1)

Aspects of a multivariate complexity analysis for rectangle tiling




Cites Work

  • Mapping a chain task to chained processors
  • Efficient array partitioning
  • Unnamed Item
  • Unnamed Item




This page was built for publication: New approximation algorithm for RTILE problem.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1401385&oldid=13559546"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 16:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki