The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Arborescence with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1972-1996 (15) 1997-2003 (20) 2004-2006 (19) 2007-2012 (15) 2013-2016 (19) 2017-2019 (17) 2020-2023 (19) 2024 (2)
Publication types (Num. hits)
article(80) incollection(1) inproceedings(43) phdthesis(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 47 occurrences of 39 keywords

Results
Found 126 publication records. Showing 126 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
123Bryant A. Julstrom, Athos Antoniades Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. Search on Bibsonomy SAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Rectilinear Steiner arborescence, perturbation coding, genetic algorithm, permutation coding
96Jason Cong, Andrew B. Kahng, Kwok-Shing Leung Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
91Nikhil Bansal 0001, Rohit Khandekar, Viswanath Nagarajan Additive guarantees for degree bounded directed network design. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximation algorithms, directed graphs, network design
82Sami Baffoun, Jean-Marc Robert 0002, Inès Gargouri Étude de la performance de quatre modèles de présentation de formulaires sur un assistant numérique personnel. Search on Bibsonomy IHM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF arborescence, e-form, flip zooming, PDA, information presentation, menu
72Michael Elkin, Guy Kortsarz Approximation Algorithm for Directed Telephone Multicast Problem. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
59Yingshu Li, My T. Thai, Feng Wang 0002, Ding-Zhu Du On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay. Search on Bibsonomy IEEE Trans. Mob. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Wireless networks, routing protocols, network management, distributed applications, algorithm design and analysis
59Sarnath Ramnath New approximations for the rectilinear Steiner arborescence problem [VLSI layout]. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
59Luis Eduardo Neves Gouveia, João Telhada An Augmented Arborescence Formulation for the Two-Level Network Design Problem. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF spanning trees and steiner trees, multicommodity flow models, network design, linear programming relaxations
46Alban Petit, Caio Corro Un algorithme d'analyse sémantique fondée sur les graphes via le problème de l'arborescence généralisée couvrante (A graph-based semantic parsing algorithm via the generalized spanning arborescence problem). Search on Bibsonomy TALN-RECITAL The full citation details ... 2022 DBLP  BibTeX  RDF
46Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
46Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sze, Qinke Wang Timing-driven Steiner trees are (practically) free. Search on Bibsonomy DAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF arborescence, timing-driven, rectilinear Steiner tree
41Davide Bilò, Luciano Gualà, Guido Proietti Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. Search on Bibsonomy CAAN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Multi-parameter Agents, Bicriteria Network Design, Truthful Single-Minded Mechanisms, Algorithmic Mechanism Design
41Rakesh Kawatra A Hop Constrained Min-Sum Arborescence with Outage Costs. Search on Bibsonomy HICSS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36MohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami MaxMin allocation via degree lower-bounded arborescences. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, linear programming, graphs, lift-and-project
36Michael J. Alexander, Gabriel Robins New performance-driven FPGA routing algorithms. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
36Vijay Chandru, John N. Hooker Extended Horn Sets In Propositional Logic. Search on Bibsonomy J. ACM The full citation details ... 1991 DBLP  DOI  BibTeX  RDF propositional logic, Horn clauses
27Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Steiner Arborescence, Prize Collecting, Network Design, Branch-and-Cut
27Mao-cheng Cai, Xiaotie Deng, Lusheng Wang 0001 Minimum k Arborescences with Bandwidth Constraints. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Arborescence, Polymatroid intersection, Algorithm and complexity, Maximum flow, Matroid, Digraph, Polymatroid
27Antonio Alonso-Ayuso, Paolo Detti, Laureano F. Escudero, M. Teresa Ortuño On Dual Based Lower Bounds for the Sequential Ordering Problem with Precedences and Due Dates. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF sequential ordering problem, due dates, minimum arborescence, permutation path, Lagrangian relaxation, Hamiltonian path, precedences
23Gourab Ray, Arnab Sen Minimal spanning arborescence. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
23Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times. Search on Bibsonomy Algorithms The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
23Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel, Luiz Filipe M. Vieira, Vinícius Fernandes dos Santos A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty. Search on Bibsonomy Int. Trans. Oper. Res. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Sumeet Batra, Bryon Tjanaka, Matthew C. Fontaine, Aleksei Petrenko, Stefanos Nikolaidis, Gaurav S. Sukhatme Proximal Policy Gradient Arborescence for Quality Diversity Reinforcement Learning. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Meike Neuwohner The 2-3-Set Packing problem and a 3/4-approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Roberto Baldacci, Edna Ayako Hoshino, Alessandro Hill New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times. Search on Bibsonomy FedCSIS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Armando Honorio Pereira, Geraldo Robson Mateus, Sebastián Urrutia Branch-and-cut algorithms for the -arborescence star problem. Search on Bibsonomy Int. Trans. Oper. Res. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Lukasz Mielewczyk, Leonidas Palios, Pawel Zylinski The Rectilinear Steiner Forest Arborescence problem. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Alan M. Frieze, Tomasz Tkocz A Randomly Weighted Minimum Arborescence with a Random Cost Constraint. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Florian Hörsch, Zoltán Szigeti Reachability in arborescence packings. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Guillaume Fertin, Julien Fradin, Géraldine Jean The Maximum Colorful Arborescence problem: How (computationally) hard can it be? Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
23Dhruv Agarwal 0003, Rico Angell, Nicholas Monath, Andrew McCallum Entity Linking and Discovery via Arborescence-based Supervised Clustering. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
23Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
23András Frank, Gergely Hajdu A simple algorithm and min-max formula for the inverse arborescence problem. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
23Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections. Search on Bibsonomy SISAP The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
23Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh 0001 Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
23Florian Hörsch, Zoltán Szigeti Reachability in arborescence packings. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
23Kim Thang Nguyen An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints. Search on Bibsonomy MFCS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
23Vinicius Morais, Bernard Gendron, Geraldo Robson Mateus The p-arborescence star problem: Formulations and exact solution approaches. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Alessandro Hill, Roberto Baldacci, Edna Ayako Hoshino Capacitated ring arborescence problems with profits. Search on Bibsonomy OR Spectr. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Alan M. Frieze, Tomasz Tkocz A randomly weighted minimum arborescence with a random cost constraint. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
23Tatsuya Matsuoka, Shin-ichi Tanigawa On reachability mixed arborescence packing. Search on Bibsonomy Discret. Optim. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Zhong Li, Chunhe Xia, Tianbo Wang, Xiaochen Liu An Information Source Identification Algorithm Based on Shortest Arborescence of Network. Search on Bibsonomy ICSCA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Tatsuya Matsuoka, Shin-ichi Tanigawa On Reachability Mixed Arborescence Packing. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
23Vinasétan Ratheil Houndji Cost-based filtering algorithms for a Capacitated Lot Sizing Problem and the Constrained Arborescence Problem. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Guillaume Fertin, Julien Fradin, Christian Komusiewicz On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. Search on Bibsonomy CPM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Guillaume Fertin, Julien Fradin, Christian Komusiewicz The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
23Yoshifumi Kusunoki, Tetsuzo Tanino Investigation on irreducible cost vectors in minimum cost arborescence problems. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
23Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl Solving minimum-cost shared arborescence problems. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
23Zaixin Lu, Zhao Zhang 0002, Weili Wu 0001 Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
23Artem Babenko, Victor S. Lempitsky AnnArbor: Approximate Nearest Neighbors Using Arborescence Coding. Search on Bibsonomy ICCV The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
23Vinasétan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence A. Wolsey The Weighted Arborescence Constraint. Search on Bibsonomy CPAIOR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
23Guillaume Fertin, Julien Fradin, Géraldine Jean Algorithmic Aspects of the Maximum Colorful Arborescence Problem. Search on Bibsonomy TAMC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
23Caio Corro, Joseph Le Roux, Mathieu Lacroix Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence. Search on Bibsonomy EMNLP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
23Vinasétan Ratheil Houndji Cost-based filtering algorithms for a capacitated lot sizing problem and the constrained arborescence problem. Search on Bibsonomy 2017   RDF
23Hao Zhu 0009, Wenping Ma 0001, Biao Hou, Licheng Jiao SAR Image Registration Based on Multifeature Detection and Arborescence Network Matching. Search on Bibsonomy IEEE Geosci. Remote. Sens. Lett. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Csaba Király 0001 On Maximal Independent Arborescence Packing. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Feng Feng, Jiajia Chen 0002, Chip-Hong Chang Hypergraph Based Minimum Arborescence Algorithm for the Optimization and Reoptimization of Multiple Constant Multiplications. Search on Bibsonomy IEEE Trans. Circuits Syst. I Regul. Pap. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Ailian Wang, Weili Wu 0001, Lei Cui 0010 On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat Rainbow Arborescence in Random Digraphs. Search on Bibsonomy J. Graph Theory The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. Search on Bibsonomy SoCG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Christian Blum 0001, Sergi Mateo Bellido Ant Colony Optimization for the Minimum-Weight Rooted Arborescence Problem. Search on Bibsonomy Handbook of Computational Intelligence The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Naoyuki Kamiyama The nucleolus of arborescence games in directed acyclic graphs. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Erez Kantor, Shay Kutten Optimal competitiveness for the Rectilinear Steiner Arborescence problem. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
23Jens Maßberg The Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
23Christian Blum 0001, Borja Calvo A matheuristic for the minimum weight rooted arborescence problem. Search on Bibsonomy J. Heuristics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Erez Kantor, Shay Kutten Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem. Search on Bibsonomy ICALP (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Yongjian Liang, Siqing Shan, Lihong Qiao, Yong Lei, Guangxun Yang Criteria for lean practice selection: Development an assessment tool using the rooted arborescence. Search on Bibsonomy CASE The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Roberto Henschel, Laura Leal-Taixé, Bodo Rosenhahn Solving Multiple People Tracking in a Minimum Cost Arborescence. Search on Bibsonomy WACV Workshops The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Erez Kantor, Shay Kutten Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems. Search on Bibsonomy ICALP (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
23Dimitri Watel Approximation de l'arborescence de Steiner. (Approximation of the Directed Steiner Tree Problem). Search on Bibsonomy 2014   RDF
23Matthias Rost, Stefan Schmid 0001 The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
23Erez Kantor, Shay Kutten Optimal competitiveness for Symmetric Rectilinear Steiner Arborescence and related problems. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
23M. G. Volz, Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas The Gilbert arborescence problem. Search on Bibsonomy Networks The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Fan Chen 0002, Christophe De Vleeschouwer Partial motion trajectory grouping through rooted arborescence. Search on Bibsonomy ICIP The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
23Sergi Mateo, Christian Blum 0001, Pascal Fua, Engin Türetken Hybrid Algorithms for the Minimum-Weight Rooted Arborescence Problem. Search on Bibsonomy ANTS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
23Matthew Drescher, Adrian Vetta An approximation algorithm for the maximum leaf spanning arborescence problem. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Alain Prodon, Scott DeNegre, Thomas M. Liebling Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems. Search on Bibsonomy Math. Program. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner Solving a k-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates. Search on Bibsonomy J. Math. Model. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
23Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura 0002, Maurício C. de Souza Models and heuristics for a minimum arborescence problem. Search on Bibsonomy Networks The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
23Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
23Rakesh Kawatra A hop constrained min-sum arborescence with outage costs. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Eduardo Conde A Branch and Bound algorithm for the minimax regret spanning arborescence. Search on Bibsonomy J. Glob. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23S. Sudha, J. Beula Sahaya Hepziba Hybrid Particle Swarm Optimization for Rectilinear Steiner Arborescence Problem. Search on Bibsonomy IICAI The full citation details ... 2007 DBLP  BibTeX  RDF
23Pasquale Avella, Domenico Villacci, Antonio Sforza A Steiner arborescence model for the feeder reconfiguration in electric distribution networks. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Weiping Shi, Chen Su The Rectilinear Steiner Arborescence Problem Is NP-Complete. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Leonidas Georgiadis Arborescence optimization problems solvable by Edmonds' algorithm. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
23V. Venkata Rao, R. Sridharan Minimum-weight rooted not-necessarily-spanning arborescence problem. Search on Bibsonomy Networks The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
23Hein van der Holst On the "largeur d'arborescence". Search on Bibsonomy J. Graph Theory The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
23Xiuzhen Cheng 0001, Bhaskar DasGupta, Bing Lu Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem. Search on Bibsonomy J. Glob. Optim. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
23Bing Lu, Lu Ruan 0001 Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
23Weiping Shi, Chen Su The rectilinear Steiner arborescence problem is NP-complete. Search on Bibsonomy SODA The full citation details ... 2000 DBLP  BibTeX  RDF
23Zhiquan Hu, Zhenhong Liu A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
23Yahya Ould Hamidoune, Michel Las Vergnas Directed switching games II The Arborescence Game. Search on Bibsonomy Discret. Math. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
23Matteo Fischetti, Daniele Vigo A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. Search on Bibsonomy Networks The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
23Jason Cong, Andrew B. Kahng, Kwok-Shing Leung Efficient heuristics for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design. Search on Bibsonomy ISPD The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
23Mauro Dell'Amico, Francesco Maffioli on Some Multicriteria Arborescence Problems: Complexity and Algorithms. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
23Harold N. Gabow Perfect Arborescence Packing in Preflow Mincut Graphs. Search on Bibsonomy SODA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
23Paolo Toth, Daniele Vigo An exact algorithm for the capacitated shortest spanning arborescence. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 126 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license