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

Algorithms and Data Structures

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

DOI10.1007/11534273zbMath1161.68675OpenAlexW3010016474MaRDI QIDQ5394235

Refael Hassin, Danny Segev

Publication date: 25 October 2006

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

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



Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)


Related Items (2)

On the multi-radius cover problem ⋮ Rounding to an integral program






This page was built for publication: Algorithms and Data Structures

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