Search results for "arborescence"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
23	Ramjee P. Swaminathan, Donald K. Wagner	The Arborescence-realization Problem.	Discret. Appl. Math.	1995	DBLP DOI BibTeX RDF
23	Gilbert Labelle, Louise Laforest	Sur la distribution de l'arité de la racine d'une arborescence hyperquaternaire à d dimensions.	Discret. Math.	1995	DBLP DOI BibTeX RDF
23	Michel X. Goemans	Arborescence Polytopes for Series-parallel Graphs.	Discret. Appl. Math.	1994	DBLP DOI BibTeX RDF
23	Matteo Fischetti, Paolo Toth	An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs.	INFORMS J. Comput.	1993	DBLP DOI BibTeX RDF
23	Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor	The Rectilinear Steiner Arborescence Problem.	Algorithmica	1992	DBLP DOI BibTeX RDF
23	Egon Balas, Matteo Fischetti	The Fixed-Outdegree 1-Arborescence Polytope.	Math. Oper. Res.	1992	DBLP DOI BibTeX RDF
23	Matteo Fischetti	Facts of two Steiner arborescence polyhedra.	Math. Program.	1991	DBLP DOI BibTeX RDF
23	Monique Guignard 0001, Moshe B. Rosenwein	An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem.	Networks	1990	DBLP DOI BibTeX RDF
23	Basil A. Kalymon	A Decomposition Algorithm for Arborescence Inventory Systems.	Oper. Res.	1972	DBLP DOI BibTeX RDF
18	Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Alves Pessoa, Marcus Poggi de Aragão, Diogo Andrade	Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) 20E28, 20G40, 20C20
18	Michael Elkin, Guy Kortsarz	An Approximation Algorithm for the Directed Telephone Multicast Problem.	Algorithmica	2006	DBLP DOI BibTeX RDF
18	William A. Greene	A tree-based genetic algorithm for building rectilinear Steiner arborescences.	GECCO	2006	DBLP DOI BibTeX RDF	rectilinear Steiner arborescences, tree-based geneticism, tree-structured chromosomes, genetic algorithms
18	Jeffrey Stanford, Sutep Tongngam	Approximation Algorithm for Maximum Lifetime in Wireless Sensor Networks with Data Aggregation.	SNPD	2006	DBLP DOI BibTeX RDF
18	Hosung (Leo) Kim, John Lillis, Milos Hrkic	Techniques for improved placement-coupled logic replication.	ACM Great Lakes Symposium on VLSI	2006	DBLP DOI BibTeX RDF	placement, timing optimization, programmable logic, logic replication
18	Gruia Calinescu, Alexander Zelikovsky	The Polymatroid Steiner Problems.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	wireless sensor networks, approximation algorithms, Steiner trees, polymatroid
18	Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni	Limitations of cross-monotonic cost sharing schemes.	SODA	2005	DBLP BibTeX RDF
18	Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich	On the random 2-stage minimum spanning tree.	SODA	2005	DBLP BibTeX RDF
18	Ephraim Korach, Margarita Razgon	Optimal Hypergraph Tree-Realization.	WG	2005	DBLP DOI BibTeX RDF
18	Gruia Calinescu, Alexander Zelikovsky	The Polymatroid Steiner Problems.	ISAAC	2004	DBLP DOI BibTeX RDF
18	Bryant A. Julstrom, Athos Antoniades	Three Evolutionary Codings of Rectilinear Steiner Arborescences.	GECCO (1)	2004	DBLP DOI BibTeX RDF
18	Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher	Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.	GECCO (1)	2004	DBLP DOI BibTeX RDF
18	Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky	Network Lifetime and Power Assignment in ad hoc Wireless Networks.	ESA	2003	DBLP DOI BibTeX RDF
18	Juan Eduardo Durán	Transformational Derivation of Greedy Network Algorithms from Descriptive Specifications.	MPC	2002	DBLP DOI BibTeX RDF
18	C. D. Randazzo, Henrique Pacca Loureiro Luna	A Comparison of Optimal Methods for Local Access Uncapacitated Network Design.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	branch-and-bound, network design, branch-and-cut, Benders decomposition
18	Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky	Improved Approximation Bounds for the Group Steiner Problem.	DATE	1998	DBLP DOI BibTeX RDF
18	Harold N. Gabow, K. S. Manu	Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs.	IPCO	1995	DBLP DOI BibTeX RDF