On the minimum corridor connection problem and other generalized geometric problems (Q833722): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: R. A. Sitters / rank
Normal rank
 
Property / author
 
Property / author: R. A. Sitters / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57338956 / 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.1016/j.comgeo.2009.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107739573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the Geometric Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for NP-hard geometric optimization problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better heuristic for orthogonal graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP with neighborhoods of varying size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for TSP with neighborhoods in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized network design problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the decomposability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the minimum-length corridor problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Branch Decompositions I: The Ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Branch Decompositions II: The Cycle Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear group Steiner trees and applications in VLSI design / rank
 
Normal rank

Latest revision as of 21:51, 1 July 2024

scientific article
Language Label Description Also known as
English
On the minimum corridor connection problem and other generalized geometric problems
scientific article

    Statements

    On the minimum corridor connection problem and other generalized geometric problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum corridor connection
    0 references
    generalized geometric problems
    0 references
    complexity
    0 references
    exact algorithms
    0 references
    approximations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references