Efficient algorithms for center problems in cactus networks (Q2371802): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2123868336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Center problems with pos/neg weights on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Obnoxious Center Problem on a Tree / 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: Shortest paths in digraphs of small treewidth. I: Sequential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-Center Problem: Exploiting Block Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. I: A data structuring technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037428 / 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: On some optimization problems on \(k\)-trees and partial \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Off-Line Maintenance of Planar Configurations / 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: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for solving the center problem on weighted cactus graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / 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: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / 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: A \(p\)-center grid-positioning aggregation procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obnoxious Facility Location on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On search over rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The obnoxious center problem on weighted cactus graphs. / rank
 
Normal rank

Latest revision as of 11:57, 26 June 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for center problems in cactus networks
scientific article

    Statements

    Efficient algorithms for center problems in cactus networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 July 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    facility location optimization
    0 references
    center problems
    0 references
    cactus networks
    0 references
    0 references
    0 references