Approximation Algorithms for Multi-Dimensional Vector Assignment Problems

SSRN Electronic Journal
doi 10.2139/ssrn.2381949
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Approximation Algorithms for Partial Covering Problems*1

Journal of Algorithms
2004English

Fast Approximation Algorithms for Multicommodity Flow Problems

1991English

Gaussian Approximation for High Dimensional Vector Under Physical Dependence

Bernoulli
StatisticsProbability
2018English

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

English

On the Approximation of Vector Optimization Problems

Kibernetika i vyčislitelʹnaâ tehnika
2015English

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

2009English

Sampling Sub-Problems of Heterogeneous Max-Cut Problems and Approximation Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

A Neural Network Parallel Algorithm for One-Dimensional Gate Assignment Problems

IEEJ Transactions on Electronics, Information and Systems
Electronic EngineeringElectrical
1997English

Approximation Algorithms for General Packing Problems With Modified Logarithmic Potential Function

2002English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy