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

Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem

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

DOI10.1007/11764298_19zbMath1196.68319OpenAlexW1759632645MaRDI QIDQ5307545

Florian Diedrich, Mihhail Aizatulin, Klaus Jansen

Publication date: 14 September 2007

Published in: Experimental Algorithms (Search for Journal in Brave)

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


zbMATH Keywords

evaluationtestingmathematical programmingimplementationfine-tuningalgorithm engineering


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)


Related Items (2)

Faster and simpler approximation algorithms for mixed packing and covering problems ⋮ An approximation algorithm for the general max-min resource sharing problem







This page was built for publication: Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem

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