The distance-constrained matroid median problem (Q2182102)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	The distance-constrained matroid median problem	scientific article

Statements

scholarly article

The distance-constrained matroid median problem (English)

Naoyuki Kamiyama

publication date

21 May 2020

full work available at URL

http://hdl.handle.net/2324/4479688

zbMATH Keywords

\(k\)-median problem

\(k\)-center problem

matroid

MaRDI profile type

MaRDI publication profile

A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems

Local Search Heuristics for <i>k</i>-Median and Facility Location Problems

An Improved Approximation for <i>k</i>-median, and Positive Correlation in Budgeted Optimization

Improved Combinatorial Algorithms for Facility Location Problems

A constant-factor approximation algorithm for the \(k\)-median problem

A Dependent LP-Rounding Approach for the k-Median Problem

Matroid and knapsack center problems

Clustering to minimize the maximum intercluster distance

Local search algorithms for the red-blue median problem

A Best Possible Heuristic for the <i>k</i>-Center Problem

A new greedy approach for facility location problems

Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation

Facility Location with Matroid or Knapsack Constraints

Approximating $k$-Median via Pseudo-Approximation

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:2182102

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2182102&oldid=38927917"