Q5881545 (Q5881545): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q582044
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.57717/cgt.v1i1.17 / rank
Normal rank
 
Property / author
 
Property / author: Michiel H. M. Smid / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: BALANCED PARTITION OF MINIMUM SPANNING TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5136221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting and covering colored points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-diameter covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Generalized MST and TSP in Grid Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity graphs of uncertainty regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximally balanced connected graph partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Maximally Balanced Connected Partition Problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum- and maximum-weight minimum spanning trees with neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cube of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5881545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax Tree Cover in the Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with 1-hamiltonian-connected cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax subtree cover problem on cacti / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Paths in the Square of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387695 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.57717/CGT.V1I1.17 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:47, 30 December 2024

scientific article; zbMATH DE number 7662164
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7662164

    Statements

    0 references
    0 references
    0 references
    10 March 2023
    0 references
    bottleneck spanning trees
    0 references
    metric space
    0 references
    partitioned point sets
    0 references
    approximation algorithms
    0 references
    NP-hardness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references