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, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

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

DOI10.1007/b11961zbMath1279.68356OpenAlexW4298253479MaRDI QIDQ5900923

Katharina Langkau, Martin Skutella, Alex Hall

Publication date: 26 May 2010

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

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


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)


Related Items

Approximating earliest arrival flows with flow-dependent transit times, Unnamed Item, Traffic Networks and Flows over Time



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