Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function (Q4632168): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2484381216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bisectors for different distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial bound for linear programming and related problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:25, 19 July 2024

scientific article; zbMATH DE number 7048072
Language Label Description Also known as
English
Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function
scientific article; zbMATH DE number 7048072

    Statements

    Identifiers