On survivable network polyhedra (Q1772416): 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.disc.2004.08.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965140003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dominant of the Steiner 2-edge connected subgraph polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-connected subgraph polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Polytope Related to the Design of Survivable Communication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>-Edge-Connected Spanning Subgraph Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. II: Properties and classes of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem on a graph and some related integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-edge connected polyhedra on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner \(k\)-edge connected subgraph polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approximation algorithm for the survivable network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree polytope and related polyhedra / 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: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-edge connected spanning subgraphs and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree polytope on 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of survivable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for generalized Steiner network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Steiner problem in outerplanar networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized steiner problem in series-parallel networks / rank
 
Normal rank

Latest revision as of 10:00, 10 June 2024

scientific article
Language Label Description Also known as
English
On survivable network polyhedra
scientific article

    Statements

    On survivable network polyhedra (English)
    0 references
    0 references
    0 references
    18 April 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Survivable network
    0 references
    Polyhedron
    0 references
    Cut
    0 references
    Series-parallel graph
    0 references
    Polynomial algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references