Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Algorithms and Data Structures

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

DOI10.1007/B11837zbMath1278.68234MaRDI QIDQ5900762

Tami Tamir, Nicholas J. A. Harvey, Richard E. Ladner

Publication date: 20 April 2010

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



Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)


Related Items (4)

An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs ⋮ A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs ⋮ A note on graph balancing problems with restrictions ⋮ Unnamed Item







This page was built for publication: Algorithms and Data Structures

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