Search results for "Tree Cover"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi	Minmax Tree Cover in the Euclidean Space.	WALCOM	2009	DBLP DOI BibTeX RDF	Minmax Tree Cover, Balanced Partition, Tree Cover, Approximation Algorithms, Graph Algorithms
2	Daniel Mölle, Stefan Richter, Peter Rossmanith	Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Enumerate and expand, Exact algorithms, Vertex cover, Parameterized complexity
2	Naoyuki Kamiyama, Naoki Katoh	The Minimum Weight In-Tree Cover Problem.	MCO	2008	DBLP DOI BibTeX RDF
2	Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang	Efficiently answering reachability queries on very large directed graphs.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	maximal directed spanning tree, path-tree cover, transitive closure, graph indexing, reachability queries
2	Toshihiro Fujito	How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover.	ICALP	2006	DBLP DOI BibTeX RDF
1	Toshihiro Fujito	How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover.	ACM Transactions on Algorithms	2012	DBLP DOI BibTeX RDF
1	Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi	Minmax Tree Cover in the Euclidean Space.	J. Graph Algorithms Appl.	2011	DBLP BibTeX RDF
1	M. Reza Khani, Mohammad R. Salavatipour	Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems.	APPROX-RANDOM	2011	DBLP DOI BibTeX RDF
1	Viet Hung Nguyen	Approximating the minimum directed tree cover	CoRR	2010	DBLP BibTeX RDF
1	G. S. Boggs	Assessment of SPOT 5 and QuickBird remotely sensed imagery for mapping tree cover in savannas.	Int. J. Applied Earth Observation and Geoinformation	2010	DBLP DOI BibTeX RDF
1	Mingdong Tang, Hongyang Chen, Guoqing Zhang, Jing Yang	Tree Cover Based Geographic Routing with Guaranteed Delivery.	ICC	2010	DBLP DOI BibTeX RDF
1	Viet Hung Nguyen	Approximation Algorithm for the Minimum Directed Tree Cover.	COCOA	2010	DBLP DOI BibTeX RDF
1	Renaud Mathieu, Konrad J. Wessels, Gregory Asner, David Knapp, Jan van Aardt, Moses Azong Cho, Barend Erasmus, Izak Smit	Tree Cover, Tree Height and Bare Soil Cover Differences along a Land Use Degradation Gradient in Semi-arid Savannas, South Africa.	IGARSS	2009	DBLP DOI BibTeX RDF
1	Somphop Limsoonthrakul, Matthew N. Dailey, Manukid Parnichkun	Intelligent vehicle localization using GPS, compass, and machine vision.	IROS	2009	DBLP DOI BibTeX RDF
1	Mudhakar Srivatsa, Bong-Jun Ko, Alina Beygelzimer, Venkateshwara Madduri	Scalable Topology Discovery and Link State Detection Using Routing Events.	SRDS	2008	DBLP DOI BibTeX RDF
1	Hiroshi Nagamochi, Kohei Okada	Approximating the minmax rooted-tree cover in a tree.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
1	Viet Hung Nguyen	Approximation algorithms for metric tree cover and generalized tour and tree covers.	RAIRO - Operations Research	2007	DBLP DOI BibTeX RDF
1	Lars T. Waser, Christian Ginzler, Meinrad Kuechler, Emmanuel Baltsavias, Henri Eisenbeiss	Modeling fractional shrub/tree cover and multi-temporal changes in mire ecosystems using high-resolution digital surface models and CIR aerial images.	IGARSS	2007	DBLP DOI BibTeX RDF
1	Ehab Morsy, Hiroshi Nagamochi	Approximating Capacitated Tree-Routings in Networks.	TAMC	2007	DBLP DOI BibTeX RDF	Tree Cover, Approximation Algorithm, Graph Algorithm, Network Optimization, Routing Problems
1	Gregory Z. Grudic, Jane Mulligan, Michael W. Otte, Adam R. Bates	Online Learning of Multiple Perceptual Models for Navigation in Unknown Terrain.	FSR	2007	DBLP DOI BibTeX RDF
1	Takashi Doi, Toshihiro Fujito	A primal-dual method for approximating tree cover with two weights.	Discrete Optimization	2006	DBLP DOI BibTeX RDF
1	Daniel Mölle, Stefan Richter, Peter Rossmanith	Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover.	CSR	2006	DBLP DOI BibTeX RDF
1	Takashi Doi, Toshihiro Fujito	A Primal-Dual Method for Approximating Tree Cover with Two Weights.	Electronic Notes in Discrete Mathematics	2004	DBLP DOI BibTeX RDF
1	Toshihiro Fujito, Takashi Doi	A 2-approximation NC algorithm for connected vertex cover and tree cover.	Inf. Process. Lett.	2004	DBLP DOI BibTeX RDF
1	Takashi Doi, Toshihiro Fujito	A Primal-Dual Method for Approximating Tree Cover with Two Weights.	CTW	2004	DBLP BibTeX RDF
1	Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha	Covering Graphs Using Trees and Stars.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
1	Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha	Improved Approximations for Tour and Tree Covers.	Algorithmica	2003	DBLP DOI BibTeX RDF	Approximation algorithms, Graph algorithms, Network design
1	Yugyung Lee, James Geller	Efficient Transitive Closure Reasoning in a Combined Class-Part-Containment Hierarchy.	Knowl. Inf. Syst.	2002	DBLP DOI BibTeX RDF	IS-A hierarchies, Materialized transitive closure, Parallel artificial intelligence, Parallel reasoning, Part hierarchies, Transitive closure reasoning
1	Mikkel Thorup, Uri Zwick	Compact routing schemes.	SPAA	2001	DBLP DOI BibTeX RDF
1	Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha	Improved approximations for tour and tree covers.	APPROX	2000	DBLP DOI BibTeX RDF
1	Zhi-Zhong Chen	A Randomized NC Algorithm for the Maximal Tree Cover Problem.	Inf. Process. Lett.	1991	DBLP DOI BibTeX RDF