On \(k\)-sum optimization (Q1919195): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/0167-6377(95)00059-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037188497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Eccentricity and absolute k-centrum of a probabilistic tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of thek-centra in a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3953561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-sum optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centers to centroids in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek-nucleus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing the sum of \(k\) tardinesses / rank
 
Normal rank

Latest revision as of 12:52, 24 May 2024

scientific article
Language Label Description Also known as
English
On \(k\)-sum optimization
scientific article

    Statements

    On \(k\)-sum optimization (English)
    0 references
    0 references
    0 references
    1 August 1996
    0 references
    \(k\)-sum optimization
    0 references
    bottleneck and minsum problems
    0 references
    polynomial time
    0 references
    \(\varepsilon\)-approximation
    0 references

    Identifiers