Approximation algorithms for orthogonal line centers (Q831691)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximation algorithms for orthogonal line centers	scientific article

Statements

scholarly article

0 references

Approximation algorithms for orthogonal line centers (English)

0 references

0 references

0 references

Joydeep Mukherjee

0 references

publication date

24 March 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-67899-9_4

0 references

Approximation algorithms for projective clustering

0 references

A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center

0 references

Approximation algorithms for a \(k\)-line center

0 references

Approximating \(k\)-orthogonal line center

0 references

SEPARATING POINTS BY AXIS-PARALLEL LINES

0 references

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane

0 references

Bi-criteria linear-time approximations for generalized k-mean/median/center

0 references

Generalized Selection and Ranking: Sorted Matrices

0 references

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

0 references

The two-line center problem from a polar view: a new algorithm and data structure

0 references

0 references

State of the Art—Location on Networks: A Survey. Part I: The <i>p</i>-Center and <i>p</i>-Median Problems

0 references

Identifiers

10.1007/978-3-030-67899-9_4

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:831691

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