Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
123 | Bryant A. Julstrom, Athos Antoniades |
Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), Nicosia, Cyprus, March 14-17, 2004, pp. 980-984, 2004, ACM, 1-58113-812-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Rectilinear Steiner arborescence, perturbation coding, genetic algorithm, permutation coding |
96 | Jason 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](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(1), pp. 24-39, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
91 | Nikhil Bansal 0001, Rohit Khandekar, Viswanath Nagarajan |
Additive guarantees for degree bounded directed network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 769-778, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, directed graphs, network design |
82 | Sami 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](Pics/bibsonomy.png) |
IHM ![In: Proceedings of the 21st International Conference of the Association Francophone d'Interaction Homme-Machine, Grenoble, France, October 13-16, 2009, pp. 23-30, 2009, ACM, 978-1-60558-461-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
arborescence, e-form, flip zooming, PDA, information presentation, menu |
72 | Michael Elkin, Guy Kortsarz |
Approximation Algorithm for Directed Telephone Multicast Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 212-223, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
59 | Yingshu 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](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 5(10), pp. 1460-1470, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Wireless networks, routing protocols, network management, distributed applications, algorithm design and analysis |
59 | Sarnath Ramnath |
New approximations for the rectilinear Steiner arborescence problem [VLSI layout]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(7), pp. 859-869, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
59 | Luis Eduardo Neves Gouveia, João Telhada |
An Augmented Arborescence Formulation for the Two-Level Network Design Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 106(1-4), pp. 47-61, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
spanning trees and steiner trees, multicommodity flow models, network design, linear programming relaxations |
46 | Alban 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](Pics/bibsonomy.png) |
TALN-RECITAL ![In: Actes de la 29e Conférence sur le Traitement Automatique des Langues Naturelles. Volume 1 : conférence principale, TALN-RECITAL 2022, Avignon, France, June 27 - July 1, 2022, pp. 226-235, 2022, ATALA. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
46 | Kristó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](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 109(23-24), pp. 1227-1231, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
46 | Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sze, Qinke Wang |
Timing-driven Steiner trees are (practically) free. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 43rd Design Automation Conference, DAC 2006, San Francisco, CA, USA, July 24-28, 2006, pp. 389-392, 2006, ACM, 1-59593-381-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
arborescence, timing-driven, rectilinear Steiner tree |
41 | Davide Bilò, Luciano Gualà, Guido Proietti |
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAN ![In: Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers, pp. 19-30, 2006, Springer, 3-540-48822-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Multi-parameter Agents, Bicriteria Network Design, Truthful Single-Minded Mechanisms, Algorithmic Mechanism Design |
41 | Rakesh Kawatra |
A Hop Constrained Min-Sum Arborescence with Outage Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 36th Hawaii International Conference on System Sciences (HICSS-36 2003), CD-ROM / Abstracts Proceedings, January 6-9, 2003, Big Island, HI, USA, pp. 72, 2003, IEEE Computer Society, 0-7695-1874-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | MohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami |
MaxMin allocation via degree lower-bounded arborescences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 543-552, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, linear programming, graphs, lift-and-project |
36 | Michael J. Alexander, Gabriel Robins |
New performance-driven FPGA routing algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(12), pp. 1505-1517, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
36 | Vijay Chandru, John N. Hooker |
Extended Horn Sets In Propositional Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(1), pp. 205-221, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
propositional logic, Horn clauses |
27 | Ivana 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](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 105(2-3), pp. 427-449, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Steiner Arborescence, Prize Collecting, Network Design, Branch-and-Cut |
27 | Mao-cheng Cai, Xiaotie Deng, Lusheng Wang 0001 |
Minimum k Arborescences with Bandwidth Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(4), pp. 529-537, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Arborescence, Polymatroid intersection, Algorithm and complexity, Maximum flow, Matroid, Digraph, Polymatroid |
27 | Antonio 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](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 124(1-4), pp. 111-131, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
sequential ordering problem, due dates, minimum arborescence, permutation path, Lagrangian relaxation, Hamiltonian path, precedences |
23 | Gourab Ray, Arnab Sen |
Minimal spanning arborescence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.13238, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni |
Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 17(1), pp. 12, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni |
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 156, pp. 106248, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Iago 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](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 30(2), pp. 1120-1143, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Sumeet 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](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.13795, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Meike 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](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.07808, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Roberto Baldacci, Edna Ayako Hoshino, Alessandro Hill |
New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 307(2), pp. 538-553, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni |
Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FedCSIS ![In: Proceedings of the 18th Conference on Computer Science and Intelligence Systems, FedCSIS 2023, Warsaw, Poland, September 17-20, 2023., pp. 421-430, 2023, 978-83-967447-8-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Armando Honorio Pereira, Geraldo Robson Mateus, Sebastián Urrutia |
Branch-and-cut algorithms for the -arborescence star problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 29(4), pp. 2374-2400, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Lukasz Mielewczyk, Leonidas Palios, Pawel Zylinski |
The Rectilinear Steiner Forest Arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.04576, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Alan M. Frieze, Tomasz Tkocz |
A Randomly Weighted Minimum Arborescence with a Random Cost Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 47(2), pp. 1664-1680, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Florian Hörsch, Zoltán Szigeti |
Reachability in arborescence packings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 320, pp. 170-183, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Guillaume Fertin, Julien Fradin, Géraldine Jean |
The Maximum Colorful Arborescence problem: How (computationally) hard can it be? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 852, pp. 104-120, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Dhruv Agarwal 0003, Rico Angell, Nicholas Monath, Andrew McCallum |
Entity Linking and Discovery via Arborescence-based Supervised Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.01242, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Lucas 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](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.14525, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | András Frank, Gergely Hajdu |
A simple algorithm and min-max formula for the inverse arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 295, pp. 85-93, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Lucas 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](Pics/bibsonomy.png) |
SISAP ![In: Similarity Search and Applications - 14th International Conference, SISAP 2021, Dortmund, Germany, September 29 - October 1, 2021, Proceedings, pp. 337-351, 2021, Springer, 978-3-030-89656-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh 0001 |
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 16(2), pp. 21:1-21:37, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Florian Hörsch, Zoltán Szigeti |
Reachability in arborescence packings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.16190, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Kim Thang Nguyen |
An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic., pp. 84:1-84:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-159-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Vinicius Morais, Bernard Gendron, Geraldo Robson Mateus |
The p-arborescence star problem: Formulations and exact solution approaches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 102, pp. 91-101, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Alessandro Hill, Roberto Baldacci, Edna Ayako Hoshino |
Capacitated ring arborescence problems with profits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR Spectr. ![In: OR Spectr. 41(2), pp. 357-389, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Alan M. Frieze, Tomasz Tkocz |
A randomly weighted minimum arborescence with a random cost constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.03375, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Tatsuya Matsuoka, Shin-ichi Tanigawa |
On reachability mixed arborescence packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 32, pp. 1-10, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Zhong Li, Chunhe Xia, Tianbo Wang, Xiaochen Liu |
An Information Source Identification Algorithm Based on Shortest Arborescence of Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSCA ![In: Proceedings of the 8th International Conference on Software and Computer Applications, ICSCA '19, Penang, Malaysia, February 19-21, 2019, pp. 442-446, 2019, ACM, 978-1-4503-6573-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Tatsuya Matsuoka, Shin-ichi Tanigawa |
On Reachability Mixed Arborescence Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.07332, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Vinasétan Ratheil Houndji |
Cost-based filtering algorithms for a Capacitated Lot Sizing Problem and the Constrained Arborescence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 23(4), pp. 481-482, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Guillaume Fertin, Julien Fradin, Christian Komusiewicz |
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 17:1-17:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Guillaume Fertin, Julien Fradin, Christian Komusiewicz |
The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1710.07584, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
23 | Yoshifumi Kusunoki, Tetsuzo Tanino |
Investigation on irreducible cost vectors in minimum cost arborescence problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 261(1), pp. 214-221, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl |
Solving minimum-cost shared arborescence problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 258(3), pp. 887-901, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Zaixin Lu, Zhao Zhang 0002, Weili Wu 0001 |
Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 33(2), pp. 803-808, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Artem Babenko, Victor S. Lempitsky |
AnnArbor: Approximate Nearest Neighbors Using Arborescence Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE International Conference on Computer Vision, ICCV 2017, Venice, Italy, October 22-29, 2017, pp. 4895-4903, 2017, IEEE Computer Society, 978-1-5386-1032-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Vinasétan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence A. Wolsey |
The Weighted Arborescence Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings, pp. 185-201, 2017, Springer, 978-3-319-59775-1. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Guillaume Fertin, Julien Fradin, Géraldine Jean |
Algorithmic Aspects of the Maximum Colorful Arborescence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings, pp. 216-230, 2017, 978-3-319-55910-0. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Caio Corro, Joseph Le Roux, Mathieu Lacroix |
Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMNLP ![In: Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, EMNLP 2017, Copenhagen, Denmark, September 9-11, 2017, pp. 1644-1654, 2017, Association for Computational Linguistics, 978-1-945626-83-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Vinasétan Ratheil Houndji |
Cost-based filtering algorithms for a capacitated lot sizing problem and the constrained arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2017 |
RDF |
|
23 | Hao Zhu 0009, Wenping Ma 0001, Biao Hou, Licheng Jiao |
SAR Image Registration Based on Multifeature Detection and Arborescence Network Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Geosci. Remote. Sens. Lett. ![In: IEEE Geosci. Remote. Sens. Lett. 13(5), pp. 706-710, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Csaba Király 0001 |
On Maximal Independent Arborescence Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 30(4), pp. 2107-2114, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Feng Feng, Jiajia Chen 0002, Chip-Hong Chang |
Hypergraph Based Minimum Arborescence Algorithm for the Optimization and Reoptimization of Multiple Constant Multiplications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Circuits Syst. I Regul. Pap. ![In: IEEE Trans. Circuits Syst. I Regul. Pap. 63-I(2), pp. 233-244, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Ailian Wang, Weili Wu 0001, Lei Cui 0010 |
On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 31(4), pp. 1678-1684, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat |
Rainbow Arborescence in Random Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 83(3), pp. 251-265, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 |
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA, pp. 39:1-39:15, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-009-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Christian Blum 0001, Sergi Mateo Bellido |
Ant Colony Optimization for the Minimum-Weight Rooted Arborescence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computational Intelligence ![In: Springer Handbook of Computational Intelligence, pp. 1333-1343, 2015, Springer, 978-3-662-43504-5. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Naoyuki Kamiyama |
The nucleolus of arborescence games in directed acyclic graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 43(1), pp. 89-92, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Erez Kantor, Shay Kutten |
Optimal competitiveness for the Rectilinear Steiner Arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1504.08265, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
23 | Jens Maßberg |
The Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1508.06792, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
23 | Christian Blum 0001, Borja Calvo |
A matheuristic for the minimum weight rooted arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 21(4), pp. 479-499, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Erez Kantor, Shay Kutten |
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, pp. 675-687, 2015, Springer, 978-3-662-47665-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Yongjian 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](Pics/bibsonomy.png) |
CASE ![In: IEEE International Conference on Automation Science and Engineering, CASE 2015, Gothenburg, Sweden, August 24-28, 2015, pp. 237-242, 2015, IEEE, 978-1-4673-8183-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Roberto Henschel, Laura Leal-Taixé, Bodo Rosenhahn |
Solving Multiple People Tracking in a Minimum Cost Arborescence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WACV Workshops ![In: 2015 IEEE Winter Conference on Applications of Computer Vision Workshops, WACV Workshops 2015, Waikoloa, HI, USA, January 6-9, 2015, pp. 71-72, 2015, IEEE Computer Society, 978-0-7695-5469-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Erez Kantor, Shay Kutten |
Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, pp. 520-531, 2014, Springer, 978-3-662-43950-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Dimitri Watel |
Approximation de l'arborescence de Steiner. (Approximation of the Directed Steiner Tree Problem). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
RDF |
|
23 | Matthias Rost, Stefan Schmid 0001 |
The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.0346, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | Erez Kantor, Shay Kutten |
Optimal competitiveness for Symmetric Rectilinear Steiner Arborescence and related problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1307.3080, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | M. G. Volz, Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas |
The Gilbert arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 61(3), pp. 238-247, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Fan Chen 0002, Christophe De Vleeschouwer |
Partial motion trajectory grouping through rooted arborescence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: 19th IEEE International Conference on Image Processing, ICIP 2012, Lake Buena Vista, Orlando, FL, USA, September 30 - October 3, 2012, pp. 1337-1340, 2012, IEEE, 978-1-4673-2534-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Sergi Mateo, Christian Blum 0001, Pascal Fua, Engin Türetken |
Hybrid Algorithms for the Minimum-Weight Rooted Arborescence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Swarm Intelligence - 8th International Conference, ANTS 2012, Brussels, Belgium, September 12-14, 2012. Proceedings, pp. 61-72, 2012, Springer, 978-3-642-32649-3. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Matthew Drescher, Adrian Vetta |
An approximation algorithm for the maximum leaf spanning arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 6(3), pp. 46:1-46:18, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Alain 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](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 124(1-2), pp. 119-141, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner |
Solving a k-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Model. Algorithms ![In: J. Math. Model. Algorithms 8(3), pp. 293-334, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura 0002, Maurício C. de Souza |
Models and heuristics for a minimum arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 51(1), pp. 34-47, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 455-464, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
23 | Rakesh Kawatra |
A hop constrained min-sum arborescence with outage costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 34(9), pp. 2648-2656, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Eduardo Conde |
A Branch and Bound algorithm for the minimax regret spanning arborescence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 37(3), pp. 467-480, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | S. Sudha, J. Beula Sahaya Hepziba |
Hybrid Particle Swarm Optimization for Rectilinear Steiner Arborescence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IICAI ![In: Proceedings of the 3rd Indian International Conference on Artificial Intelligence, Pune, India, December 17-19, 2007, pp. 292-300, 2007, IICAI, 978-0-9727412-2-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
23 | Pasquale Avella, Domenico Villacci, Antonio Sforza |
A Steiner arborescence model for the feeder reconfiguration in electric distribution networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 164(2), pp. 505-509, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Weiping Shi, Chen Su |
The Rectilinear Steiner Arborescence Problem Is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 35(3), pp. 729-740, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Leonidas Georgiadis |
Arborescence optimization problems solvable by Edmonds' algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 301(1-3), pp. 427-437, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | V. Venkata Rao, R. Sridharan |
Minimum-weight rooted not-necessarily-spanning arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 39(2), pp. 77-87, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Hein van der Holst |
On the "largeur d'arborescence". ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 41(1), pp. 24-52, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Xiuzhen Cheng 0001, Bhaskar DasGupta, Bing Lu |
Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 21(4), pp. 385-396, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Bing Lu, Lu Ruan 0001 |
Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 4(3), pp. 357-363, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Weiping Shi, Chen Su |
The rectilinear Steiner arborescence problem is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA., pp. 780-787, 2000, ACM/SIAM, 0-89871-453-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
23 | Zhiquan Hu, Zhenhong Liu |
A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 82(1-3), pp. 135-154, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Yahya Ould Hamidoune, Michel Las Vergnas |
Directed switching games II The Arborescence Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 165-166, pp. 395-402, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Matteo Fischetti, Daniele Vigo |
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 29(1), pp. 55-67, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Jason 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](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 1997 International Symposium on Physical Design, ISPD 1997, Napa Valley, California, USA, April 14-16, 1997, pp. 88-95, 1997, ACM, 0-89791-927-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Mauro Dell'Amico, Francesco Maffioli |
on Some Multicriteria Arborescence Problems: Complexity and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 65(1-3), pp. 191-206, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Harold N. Gabow |
Perfect Arborescence Packing in Preflow Mincut Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA., pp. 528-538, 1996, ACM/SIAM, 0-89871-366-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Paolo Toth, Daniele Vigo |
An exact algorithm for the capacitated shortest spanning arborescence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 61(1), pp. 121-141, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|