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

Approximation Algorithms for Capacitated Rectangle Stabbing

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

DOI10.1007/11758471_5zbMath1183.68742OpenAlexW1527755298MaRDI QIDQ3434539

Guy Even, Shimon (Moni) Shahar, Dror Rawitz

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758471_5



Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)


Related Items (2)

Capacitated Arc Stabbing ⋮ The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants






This page was built for publication: Approximation Algorithms for Capacitated Rectangle Stabbing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3434539&oldid=16742955"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 19:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki