scientific article; zbMATH DE number 2119651

From MaRDI portal

Revision as of 02:15, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4828922

Jump to:navigation, search

zbMath1093.68628MaRDI QIDQ4828922

Martín Farach-Colton, Rahul Shah

Publication date: 29 November 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Discrete location and assignment (90B80)

Related Items (5)

Space-Efficient Frameworks for Top- k String Retrieval ⋮ Online clustering with variable sized clusters ⋮ Optimizing server placement in distributed systems in the presence of competition ⋮ Finding the conditional location of a median path on a tree ⋮ On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4828922&oldid=19159514"