„Steiner network problems“

Suchergebnisse

19 Treffer

• Solving two-stage stochastic network design problems to optimality
  Zey, Bernd ; Mutzel, Petra ; Buchheim, Christoph 2017 Universitätsbibliothek Dortmund
• Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification
  Galby, Esther ; Kisfaludi-Bak, Sándor ; Marx, Dániel ; Sharma, Roohani 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 1.757 and 1.267 - approximation algorithms for the network and rectilinear Steiner tree problems
  Karpiński, Marek ; Zelikovsky, Alexander 1995 Inst. für Informatik
• The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
  Feldmann, Andreas Emil ; Marx, Dániel 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
  Chitnis, Rajesh ; Feldmann, Andreas Emil ; Manurangsi, Pasin 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Approximating Degree-Bounded Network Design Problems
  Guo, Xiangyu ; Kortsarz, Guy ; Laekhanukit, Bundit ; Li, Shi ; Vaz, Daniel ; Xian, Jiayi 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Exact Algorithm for the Steiner Forest Problem
  Schmidt, Daniel R. ; Zey, Bernd ; Margot, François 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network
  Dinur, Irit ; Manurangsi, Pasin 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximating Directed Steiner Problems via Tree Embedding
  Laekhanukit, Bundit 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk)
  Marx, Dániel 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees
  Chimani, Markus ; Spoerhase, Joachim 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
  Borradaile, Glencora ; Demaine, Erik D. ; Tazari, Siamak 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A primal-dual approximation algorithm for generalized steiner network problems
  Williamson, David P. ; Goemans, Michel X. ; Mihail, Milena ; Vazirani, Vijay V.
• On Steiner Versions of (bi)Connectivity in Network Problems
  Volgenant, A. ; Duin, C.W
• Two new criteria for finding Steiner hulls in Steiner tree problems
  Provan, J. Scott
• Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
  Remy, Jan ; Steger, Angelika
• Problems with generalized steiner problems
  Voß, Stefan
• Strong formulations for 2-node-connected Steiner network problems
  Chimani, Markus 2007 Univ., Algorithm Engineering
• Matroid Steiner problems, the Tutte polynomial and network reliability
  Colbourn, Charles J. ; Pulleyblank, William R. 1987 Inst. für Ökonometrie u. Operations-Research