New Approximation Results for Resource Replication Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-32512-0_19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Improved Approximation Results for Stochastic Knapsack Problems

2011English

Degree-Constrained Subgraph Problems: Hardness and Approximation Results

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

New Results on Intersection Query Problems

Computer Journal
Computer Science
1997English

Approximation of Bayesian Inverse Problems for PDEs

SIAM Journal on Numerical Analysis
Computational MathematicsApplied MathematicsNumerical Analysis
2010English

Variational Bayesian Approximation Methods for Inverse Problems

Journal of Physics: Conference Series
AstronomyPhysics
2012English

Tight Approximation Algorithm for Connectivity Augmentation Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2008English

A Conditional Saddlepoint Approximation for Testing Problems

Journal of the American Statistical Association
UncertaintyStatisticsProbability
1999English

Approximation Algorithms for Partial Covering Problems*1

Journal of Algorithms
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy