Improved Deletions in Dynamic Spatial Approximation Trees

doi 10.1109/sccc.2003.1245441
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE

Related search

Improved Approximation Algorithms for Firefighter Problem on Trees

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2011English

Improved Anonymity for Key-Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

An Improved Toeplitz Approximation Method

1988English

Stable Function Approximation in Dynamic Programming

1995English

Improved Approximation of Linear Threshold Functions

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2012English

Improved Approximation Algorithms for Tree Alignment

Journal of Algorithms
1997English

Improved Approximation Results for Stochastic Knapsack Problems

2011English

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time

2020English

Cost Bounds and Approximation Ratios of Multicast Light-Trees in WDM Networks

Journal of Optical Communications and Networking
Computer NetworksCommunications
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy