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

scientific article

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

zbMath0987.68091MaRDI QIDQ2768361

Rajmohan Rajaraman, Ivan D. Baev

Publication date: 30 January 2002


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

zbMATH Keywords

data placement problem


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05)


Related Items (8)

New approximation results for resource replication problems ⋮ Improved approximation algorithms for data migration ⋮ Optimal data placement on networks with a constant number of clients ⋮ Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding ⋮ Facility location with red-blue demands ⋮ Multi-objective evolutionary algorithms for a reliability location problem ⋮ Joint object placement and node dimensioning for internet content distribution ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks






This page was built for publication:

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