Search results for "Arborescence"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
123	Bryant A. Julstrom, Athos Antoniades	Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem.	SAC	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.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1998	DBLP DOI BibTeX RDF
91	Nikhil Bansal 0001, Rohit Khandekar, Viswanath Nagarajan	Additive guarantees for degree bounded directed network design.	STOC	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.	IHM	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.	ICALP	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.	IEEE Trans. Mob. Comput.	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].	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
59	Luis Eduardo Neves Gouveia, João Telhada	An Augmented Arborescence Formulation for the Two-Level Network Design Problem.	Ann. Oper. Res.	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).	TALN-RECITAL	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.	Inf. Process. Lett.	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.	DAC	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.	CAAN	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.	HICSS	2003	DBLP DOI BibTeX RDF
36	MohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami	MaxMin allocation via degree lower-bounded arborescences.	STOC	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.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
36	Vijay Chandru, John N. Hooker	Extended Horn Sets In Propositional Logic.	J. ACM	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.	Math. Program.	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.	Algorithmica	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.	Ann. Oper. Res.	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.	CoRR	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.	Algorithms	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.	Comput. Oper. Res.	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.	Int. Trans. Oper. Res.	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.	CoRR	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.	CoRR	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.	Eur. J. Oper. Res.	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.	FedCSIS	2023	DBLP DOI BibTeX RDF
23	Armando Honorio Pereira, Geraldo Robson Mateus, Sebastián Urrutia	Branch-and-cut algorithms for the -arborescence star problem.	Int. Trans. Oper. Res.	2022	DBLP DOI BibTeX RDF
23	Lukasz Mielewczyk, Leonidas Palios, Pawel Zylinski	The Rectilinear Steiner Forest Arborescence problem.	CoRR	2022	DBLP DOI BibTeX RDF
23	Alan M. Frieze, Tomasz Tkocz	A Randomly Weighted Minimum Arborescence with a Random Cost Constraint.	Math. Oper. Res.	2022	DBLP DOI BibTeX RDF
23	Florian Hörsch, Zoltán Szigeti	Reachability in arborescence packings.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
23	Guillaume Fertin, Julien Fradin, Géraldine Jean	The Maximum Colorful Arborescence problem: How (computationally) hard can it be?	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
23	Dhruv Agarwal 0003, Rico Angell, Nicholas Monath, Andrew McCallum	Entity Linking and Discovery via Arborescence-based Supervised Clustering.	CoRR	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].	CoRR	2021	DBLP BibTeX RDF
23	András Frank, Gergely Hajdu	A simple algorithm and min-max formula for the inverse arborescence problem.	Discret. Appl. Math.	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.	SISAP	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.	ACM Trans. Algorithms	2020	DBLP DOI BibTeX RDF
23	Florian Hörsch, Zoltán Szigeti	Reachability in arborescence packings.	CoRR	2020	DBLP BibTeX RDF
23	Kim Thang Nguyen	An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints.	MFCS	2020	DBLP DOI BibTeX RDF
23	Vinicius Morais, Bernard Gendron, Geraldo Robson Mateus	The p-arborescence star problem: Formulations and exact solution approaches.	Comput. Oper. Res.	2019	DBLP DOI BibTeX RDF
23	Alessandro Hill, Roberto Baldacci, Edna Ayako Hoshino	Capacitated ring arborescence problems with profits.	OR Spectr.	2019	DBLP DOI BibTeX RDF
23	Alan M. Frieze, Tomasz Tkocz	A randomly weighted minimum arborescence with a random cost constraint.	CoRR	2019	DBLP BibTeX RDF
23	Tatsuya Matsuoka, Shin-ichi Tanigawa	On reachability mixed arborescence packing.	Discret. Optim.	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.	ICSCA	2019	DBLP DOI BibTeX RDF
23	Tatsuya Matsuoka, Shin-ichi Tanigawa	On Reachability Mixed Arborescence Packing.	CoRR	2018	DBLP BibTeX RDF
23	Vinasétan Ratheil Houndji	Cost-based filtering algorithms for a Capacitated Lot Sizing Problem and the Constrained Arborescence Problem.	Constraints An Int. J.	2018	DBLP DOI BibTeX RDF
23	Guillaume Fertin, Julien Fradin, Christian Komusiewicz	On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure.	CPM	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.	CoRR	2017	DBLP BibTeX RDF
23	Yoshifumi Kusunoki, Tetsuzo Tanino	Investigation on irreducible cost vectors in minimum cost arborescence problems.	Eur. J. Oper. Res.	2017	DBLP DOI BibTeX RDF
23	Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl	Solving minimum-cost shared arborescence problems.	Eur. J. Oper. Res.	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.	J. Comb. Optim.	2017	DBLP DOI BibTeX RDF
23	Artem Babenko, Victor S. Lempitsky	AnnArbor: Approximate Nearest Neighbors Using Arborescence Coding.	ICCV	2017	DBLP DOI BibTeX RDF
23	Vinasétan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence A. Wolsey	The Weighted Arborescence Constraint.	CPAIOR	2017	DBLP DOI BibTeX RDF
23	Guillaume Fertin, Julien Fradin, Géraldine Jean	Algorithmic Aspects of the Maximum Colorful Arborescence Problem.	TAMC	2017	DBLP DOI BibTeX RDF
23	Caio Corro, Joseph Le Roux, Mathieu Lacroix	Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence.	EMNLP	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.		2017	RDF
23	Hao Zhu 0009, Wenping Ma 0001, Biao Hou, Licheng Jiao	SAR Image Registration Based on Multifeature Detection and Arborescence Network Matching.	IEEE Geosci. Remote. Sens. Lett.	2016	DBLP DOI BibTeX RDF
23	Csaba Király 0001	On Maximal Independent Arborescence Packing.	SIAM J. Discret. Math.	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.	IEEE Trans. Circuits Syst. I Regul. Pap.	2016	DBLP DOI BibTeX RDF
23	Ailian Wang, Weili Wu 0001, Lei Cui 0010	On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence.	J. Comb. Optim.	2016	DBLP DOI BibTeX RDF
23	Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat	Rainbow Arborescence in Random Digraphs.	J. Graph Theory	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.	SoCG	2016	DBLP DOI BibTeX RDF
23	Christian Blum 0001, Sergi Mateo Bellido	Ant Colony Optimization for the Minimum-Weight Rooted Arborescence Problem.	Handbook of Computational Intelligence	2015	DBLP DOI BibTeX RDF
23	Naoyuki Kamiyama	The nucleolus of arborescence games in directed acyclic graphs.	Oper. Res. Lett.	2015	DBLP DOI BibTeX RDF
23	Erez Kantor, Shay Kutten	Optimal competitiveness for the Rectilinear Steiner Arborescence problem.	CoRR	2015	DBLP BibTeX RDF
23	Jens Maßberg	The Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete.	CoRR	2015	DBLP BibTeX RDF
23	Christian Blum 0001, Borja Calvo	A matheuristic for the minimum weight rooted arborescence problem.	J. Heuristics	2015	DBLP DOI BibTeX RDF
23	Erez Kantor, Shay Kutten	Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem.	ICALP (2)	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.	CASE	2015	DBLP DOI BibTeX RDF
23	Roberto Henschel, Laura Leal-Taixé, Bodo Rosenhahn	Solving Multiple People Tracking in a Minimum Cost Arborescence.	WACV Workshops	2015	DBLP DOI BibTeX RDF
23	Erez Kantor, Shay Kutten	Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems.	ICALP (2)	2014	DBLP DOI BibTeX RDF
23	Dimitri Watel	Approximation de l'arborescence de Steiner. (Approximation of the Directed Steiner Tree Problem).		2014	RDF
23	Matthias Rost, Stefan Schmid 0001	The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation.	CoRR	2013	DBLP BibTeX RDF
23	Erez Kantor, Shay Kutten	Optimal competitiveness for Symmetric Rectilinear Steiner Arborescence and related problems.	CoRR	2013	DBLP BibTeX RDF
23	M. G. Volz, Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas	The Gilbert arborescence problem.	Networks	2013	DBLP DOI BibTeX RDF
23	Fan Chen 0002, Christophe De Vleeschouwer	Partial motion trajectory grouping through rooted arborescence.	ICIP	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.	ANTS	2012	DBLP DOI BibTeX RDF
23	Matthew Drescher, Adrian Vetta	An approximation algorithm for the maximum leaf spanning arborescence problem.	ACM Trans. Algorithms	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.	Math. Program.	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.	J. Math. Model. Algorithms	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.	Networks	2008	DBLP DOI BibTeX RDF
23	Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi	Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.	SODA	2008	DBLP BibTeX RDF
23	Rakesh Kawatra	A hop constrained min-sum arborescence with outage costs.	Comput. Oper. Res.	2007	DBLP DOI BibTeX RDF
23	Eduardo Conde	A Branch and Bound algorithm for the minimax regret spanning arborescence.	J. Glob. Optim.	2007	DBLP DOI BibTeX RDF
23	S. Sudha, J. Beula Sahaya Hepziba	Hybrid Particle Swarm Optimization for Rectilinear Steiner Arborescence Problem.	IICAI	2007	DBLP BibTeX RDF
23	Pasquale Avella, Domenico Villacci, Antonio Sforza	A Steiner arborescence model for the feeder reconfiguration in electric distribution networks.	Eur. J. Oper. Res.	2005	DBLP DOI BibTeX RDF
23	Weiping Shi, Chen Su	The Rectilinear Steiner Arborescence Problem Is NP-Complete.	SIAM J. Comput.	2005	DBLP DOI BibTeX RDF
23	Leonidas Georgiadis	Arborescence optimization problems solvable by Edmonds' algorithm.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
23	V. Venkata Rao, R. Sridharan	Minimum-weight rooted not-necessarily-spanning arborescence problem.	Networks	2002	DBLP DOI BibTeX RDF
23	Hein van der Holst	On the "largeur d'arborescence".	J. Graph Theory	2002	DBLP DOI BibTeX RDF
23	Xiuzhen Cheng 0001, Bhaskar DasGupta, Bing Lu	Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem.	J. Glob. Optim.	2001	DBLP DOI BibTeX RDF
23	Bing Lu, Lu Ruan 0001	Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem.	J. Comb. Optim.	2000	DBLP DOI BibTeX RDF
23	Weiping Shi, Chen Su	The rectilinear Steiner arborescence problem is NP-complete.	SODA	2000	DBLP BibTeX RDF
23	Zhiquan Hu, Zhenhong Liu	A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem.	Discret. Appl. Math.	1998	DBLP DOI BibTeX RDF
23	Yahya Ould Hamidoune, Michel Las Vergnas	Directed switching games II The Arborescence Game.	Discret. Math.	1997	DBLP DOI BibTeX RDF
23	Matteo Fischetti, Daniele Vigo	A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem.	Networks	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.	ISPD	1997	DBLP DOI BibTeX RDF
23	Mauro Dell'Amico, Francesco Maffioli	on Some Multicriteria Arborescence Problems: Complexity and Algorithms.	Discret. Appl. Math.	1996	DBLP DOI BibTeX RDF
23	Harold N. Gabow	Perfect Arborescence Packing in Preflow Mincut Graphs.	SODA	1996	DBLP DOI BibTeX RDF
23	Paolo Toth, Daniele Vigo	An exact algorithm for the capacitated shortest spanning arborescence.	Ann. Oper. Res.	1995	DBLP DOI BibTeX RDF