Approximation Algorithms for General Packing Problems With Modified Logarithmic Potential Function

doi 10.1007/978-0-387-35608-2_22
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer US

Related search

Faster Algebraic Algorithms for Path and Packing Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Approximation Algorithms for Partial Covering Problems*1

Journal of Algorithms
2004English

Fast Approximation Algorithms for Multicommodity Flow Problems

1991English

Probabilistic Analysis of Algorithms for Dual Bin Packing Problems

Journal of Algorithms
1991English

Approximation Algorithms for Multi-Dimensional Vector Assignment Problems

SSRN Electronic Journal
2013English

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

English

A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
MathematicsComputer Science
1995English

Faster Scaling Algorithms for General Graph Matching Problems

1989English

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy