Amanote Research

Amanote Research

    RegisterSign In

Optimal Algorithms and Approximation Algorithms for Replica Placement With Distance Constraints in Tree Networks

doi 10.1109/ipdps.2012.95
Full Text
Open PDF
Abstract

Available in full text

Date

May 1, 2012

Authors
A. BenoitH. LarchevequeP. Renaud-Goud
Publisher

IEEE


Related search

Approximation Algorithms for Computing Capacity of Wireless Networks With SINR Constraints

2008English

Improved Approximation Algorithms for Tree Alignment

Journal of Algorithms
1997English

Approximation Algorithms for Geometric Networks

English

Near-Optimal Sublinear Time Algorithms for Ulam Distance

2010English

Parallel Algorithms for Approximation of Distance Maps on Parametric Surfaces

ACM Transactions on Graphics
Computer GraphicsComputer-Aided Design
2008English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots With Decoupled Dynamics Bounds

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1995English

Automatic Design of Decision-Tree Algorithms With Evolutionary Algorithms

Evolutionary Computation
Computational Mathematics
2013English

Sensor Placement in Water Distribution Networks Based on Spectral Algorithms

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy