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

An approximation algorithm for sequential rectangle placement

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

DOI10.1016/j.ipl.2008.08.001zbMath1191.68867OpenAlexW1966528794MaRDI QIDQ975504

Amos Israeli, Oran Sharon

Publication date: 9 June 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.08.001


zbMATH Keywords

approximation algorithmssequential rectangle placement


Mathematics Subject Classification ID

Approximation algorithms (68W25)


Related Items (1)

Complexity and approximation of an area packing problem



Cites Work

  • Unnamed Item
  • Unnamed Item
  • On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
  • Algorithm Theory - SWAT 2004
  • Mathematical Foundations of Computer Science 2005




This page was built for publication: An approximation algorithm for sequential rectangle placement

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