Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-012-9655-1 / rank
Normal rank
 
Property / author
 
Property / author: Arie Tamir / rank
Normal rank
 
Property / author
 
Property / author: Arie Tamir / rank
 
Normal rank
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/s00453-012-9655-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038526704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation of the Condorcet and Simpson conditions in voting location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-vertex duality and the one-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding kth paths and p-centers by generating and searching good data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating new facilities in a competitive environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Voting and Competitive Location on a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding P-centers on a weighted tree (for relatively small P) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width, path-width, and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Coverage Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple voting location and single voting location on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((r,p)\)-centroid problems on paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The least element property of center location on tree networks with applications to distance and precedence constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-012-9655-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:47, 18 December 2024

scientific article
Language Label Description Also known as
English
Improved algorithms for some competitive location centroid problems on paths, trees and graphs
scientific article

    Statements

    Improved algorithms for some competitive location centroid problems on paths, trees and graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2013
    0 references
    competitive location problems
    0 references
    centroids
    0 references
    paths
    0 references
    trees
    0 references
    polynomial algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers