"Approximation to the Minimum Rooted Star Cover Problem"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
No cover, no minimum /	Eckstine, Billy,; Tucker, Bobby,
No cover, no minimum	Eckstine, Billy.	[1960?]	Roulette Birdland,
Programming the approximation problem of network synthesis	Frederic E. Beck	1958	Naval Postgraduate School
Cover to Cover	Robert Craig	March 2004	George Weidenfeld & Nicholson
Cover to Cover	Robert Craig	March 2004	Phoenix House
Cover to Cover	Dana Brown	September 2000	Writers Club Press
Cover To Cover Bible Companion (Cover to Cover Resources)	Selwyn Hughes	June 1, 2001	Crusade for World Revival
Ecclesiastes (Cover To Cover)	Chris Brearley	September 2005	Crusade for World Revival
Revelation (Cover To Cover)	Brian Hoare	January 1, 2007	Crusade for World Revival
An approximation method for solving the sofa problem	Kiyoshi Maruyama	1971	Dept. of Computer Science, University of Illinois at Urbana-Champaign
Cover to Cover Through the Bible	Selwyn Hughes	1999	Crusade for World Revival (CWR)
The problem of the minimum of a quadratic functional	S. G. Mikhlin	1965	Holden-Day
The problem of the minimum of a quadratic functional	S. G. Mikhlin	1965	Holden-Day
Computer programs for the two body approximation to the radiation damage problem	John P. Bird	1963	Naval Postgraduate School
Classic Penguin: cover to cover /	Buckley, Paul,; Niffenegger, Audrey,; Rotor, Elda,; Vee, Matt,		Penguin Books
Marilyn Monroe: cover to cover	Clark Kidder	2003	Krause Publications
Soccer Mad (Cover to Cover)	Rob Childs	May 1, 1998	BBC Audiobooks
Mission Sabotage (Cover-to-Cover Books)	Dee Stuart	June 2002	Perfection Learning (Sd)
Cover to Cover: Book & Editorial Design	Pie Books	June 1992	Books Nippan
A problem in estimating a distribution by minimum risk	Mete Özer	1970	Naval Postgraduate School
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Approximation to the Minimum Rooted Star Cover Problem	Wenbo Zhao; Peng Zhang	Theory and Applications of Models of Computation: 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings	Jin-Yi Cai; Barry S. Cooper; Hong Zhu	2007	Springer Berlin Heidelberg
The Minimum Rooted-Cycle Cover Problem	D. Cornaz; Y. Magnouche	Combinatorial Optimization: 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers	Jon Lee; Giovanni Rinaldi; A. Ridha Mahjoub	1st ed. 2018	Springer International Publishing
New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem	Jiangkun Li; Peng Zhang	Combinatorial Optimization and Applications: 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings	Ding-Zhu Du; Donglei Du; Chenchen Wu; Dachuan Xu	1st ed. 2021	Springer International Publishing
Approximation Algorithms for the Minimum Power Partial Cover Problem	Menghong Li; Yingli Ran; Zhao Zhang	Algorithmic Aspects in Information and Management: 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings	Ding-Zhu Du; Lian Li; Xiaoming Sun; Jialin Zhang	1st ed. 2019	Springer International Publishing
New Approximation Algorithms for the Minimum Cycle Cover Problem	Wei Yu; Zhaohui Liu; Xiaoguang Bao	Frontiers in Algorithmics: 12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings	Jianer Chen; Pinyan Lu	1st ed. 2018	Springer International Publishing
The Minimum Substring Cover Problem	Danny Hermelin; Dror Rawitz; Romeo Rizzi; Stéphane Vialette	Approximation and Online Algorithms: 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007, Revised Papers	Christos Kaklamanis; Martin Skutella	2008	Springer Berlin Heidelberg
Approximation to the Minimum Cost Edge Installation Problem	Ehab Morsy; Hiroshi Nagamochi	Algorithms and Computation: 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings	Takeshi Tokuyama	2007	Springer Berlin Heidelberg
Approximation to the Minimum Cost Edge Installation Problem		Algorithms and Computation. 18th International Symposium, ISAAC 2007 Sendai, Japan, December 17-19, 2007 Proceedings	Takeshi Tokuyama (ed.)	2013	Springer Nature.
An Approximation Algorithm for the Minimum Latency Set Cover Problem	Refael Hassin; Asaf Levin	Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings	Gerth S. Brodal; Stefano Leonardi	2005	Springer Berlin Heidelberg
Approximation Algorithm for the Minimum Connected \(k\) -Path Vertex Cover Problem	Xiaosong Li; Zhao Zhang; Xiaohui Huang	Combinatorial Optimization and Applications: 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings	Zhao Zhang; Lidong Wu; Wen Xu; Ding-Zhu Du	2014	Springer International Publishing
Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover Problem	Pengcheng Liu; Xiaohui Huang; Zhao Zhang	Combinatorial Optimization and Applications: 13th International Conference, COCOA 2019, Xiamen, China, December 13–15, 2019, Proceedings	Yingshu Li; Mihaela Cardei; Yan Huang	1st ed. 2019	Springer International Publishing
The Minimum Generalized Vertex Cover Problem	Refael Hassin; Asaf Levin	Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings	Giuseppe Di Battista; Uri Zwick	2003	Springer Berlin Heidelberg
The Minimum-Entropy Set Cover Problem	Eran Halperin; Richard M. Karp	Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, Proceedings	Josep Díaz; Juhani Karhumäki; Arto Lepistö; Donald Sannella	2004	Springer Berlin Heidelberg
Minimum Spanning Rooted Tree		7 Algorithm Design Paradigms	Sung-Hyuk Cha
Hybrid Algorithms for the Minimum-Weight Rooted Arborescence Problem	Sergi Mateo; Christian Blum; Pascal Fua; Engin Türetgen	Swarm Intelligence: 8th International Conference, ANTS 2012, Brussels, Belgium, September 12-14, 2012, Proceedings	Mauro Birattari; Christian Blum; Anders Lyhne Christensen; Andries P. Engelbrecht; Roderich Groß; Marco Dorigo; Thomas Stützle	2012	Springer Berlin Heidelberg
Approximation Algorithm for the Minimum Directed Tree Cover	Viet Hung Nguyen	Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II	Weili Wu; Ovidiu Daescu	2010	Springer Berlin Heidelberg
An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem	Jayanth Kumar Thenepalle; Purusotham Singamsetty	Advances in Algebra and Analysis: International Conference on Advances in Mathematical Sciences, Vellore, India, December 2017 - Volume I	V. Madhu; A. Manimaran; D. Easwaramoorthy; D. Kalpanapriya; M. Mubashir Unnissa	1st ed. 2018	Springer International Publishing
Approximation Algorithms for the Minimum Convex Partition Problem	Christian Knauer; Andreas Spillner	Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings	Lars Arge; Rusins Freivalds	2006	Springer Berlin Heidelberg
Approximation Bounds for the Minimum \(k\) -Storage Problem	Gianlorenzo D’Angelo; Daniele Diodati; Alfredo Navarra; Cristina M. Pinotti	Algorithms for Sensor Systems: 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers	Paola Flocchini; Jie Gao; Evangelos Kranakis; Friedhelm Meyer auf der Heide	2013	Springer Berlin Heidelberg
Ant Colony Optimization for the Minimum-Weight Rooted Arborescence Problem	Christian Blum; Sergi Mateo Bellido	Springer Handbook of Computational Intelligence	Janusz Kacprzyk; Witold Pedrycz	2015	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Approximation to the Minimum Rooted Star Cover Problem" - similar Books and Chapters