"An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
An algorithm for the traveling salesman problem	John D. C. Little	1963	M.I.T.
On the convergence of an algorithm for rational Chebyshev approximation	Richard H. Franke	1973	Naval Postgraduate School
No cover, no minimum /	Eckstine, Billy,; Tucker, Bobby,
No cover, no minimum	Eckstine, Billy.	[1960?]	Roulette Birdland,
Fixed point smoothing algorithm to the torpedo tracking problem	Sadi Karaman	1986
An approximation method for solving the sofa problem	Kiyoshi Maruyama	1971	Dept. of Computer Science, University of Illinois at Urbana-Champaign
An O(/E/loglog/V/) algorithm for finding minimum spanning trees	Andrew Chi-Chih Yao	1974	Dept. of Computer Science, University of Illinois at Urbana-Champaign
An algorithm for generalized point location and its applications	B. Chazelle	1988	Courant Institute of Mathematical Sciences, New York University
An algorithm for generating ship schedules for a crisis deployment problem	Svein Buvik	1988
An algorithm for solving a range constrained traveling salesman problem	John William Harms	1976	Naval Postgraduate School
An algorithm for computing options on the maximum or minimum of several assets	Phelim P. Boyle	1989	College of Commerce and Business Administration, University of Illinois Urbana-Champaign
An algorithm for the symmetric generalized eigenvalue problem Ax = [delta]Bx	Chang-chung Chang	1974	Center for Advanced Computation, University of Illinois at Urbana - Champaign
Vertex algebras for beginners /	Kac, Victor G.,	[1997], ©1997.	American Mathematical Society,
An O(n log n) algorithm for the maximal planar subgraph problem.	Jiazhen Cai	1992	Courant Institute of Mathematical Sciences, New York University
An O(n log n) algorithm for the maximal planar subgraph problem	Jiazhen Cai	1992	Courant Institute of Mathematical Sciences, New York University
An Improved Gradient Algorithm For The Solution of Two-Point Boundary-Value Problems	John Allen Battenburg	1968	Naval Postgraduate School;Available from National Technical Information Service
An interior point algorithm for nonlinear quantile regression / Roger Koenker; Beum J. Park	Roger W. Koenker	1992	University of Illinois at Urbana-Champaign
A branch and exclude algorithm for the knapsack problem	Robert Lawrence Hegerich	1968	Naval Postgraduate School;Available from National Technical Information Service
Wavelet Based Approximation Schemes for Singular Integral Equations	M M Panja; B N Mandal	2020	Routledge
Problem-based learning for administrators	Edwin M. Bridges	1992	ERIC
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
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
Vertex Cover Problem—Revised Approximation Algorithm	Kartik Shah; Praveenkumar Reddy; R. Selvakumar	Artificial Intelligence and Evolutionary Algorithms in Engineering Systems: Proceedings of ICAEES 2014, Volume 1	L. Padma Suresh; Subhransu Sekhar Dash; Bijaya Ketan Panigrahi	2015	Springer India
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
An Algorithm Based on Hopfield Network Learning for Minimum Vertex Cover Problem	Xiaoming Chen; Zheng Tang; Xinshun Xu; Songsong Li; Guangpu Xia; Jiahai Wang	Advances in Neural Networks - ISNN 2004: International Symposium on Neural Networks, Dalian, China, August 19-21, 2004, Proceedings, Part I	Fuliang Yin; Jun Wang; Chengan Guo	2004	Springer Berlin Heidelberg
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
An Approximation Algorithm for Weak Vertex Cover Problem in Network Management	Zhiping Cai; Jianping Yin; Xianghui Liu; Shaohe Lv	Algorithmic Applications in Management: First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings	Nimrod Megiddo; Yinfeng Xu; Binhai Zhu	2005	Springer Berlin Heidelberg
An eptas for Minimum Vertex Cover		Optimization and approximation on systems of geometric objects	van Leeuwen E.	2009	CWI
ACS for the Minimum Vertex Cover Problem		Ant Colony Optimization and Swarm Intelligence: 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4-7, 2006, Proceedings	Chris Sells, Ian Griffiths	2006	Springer
A Local 2-Approximation Algorithm for the Vertex Cover Problem	Matti Åstrand; Patrik Floréen; Valentin Polishchuk; Joel Rybicki; Jukka Suomela; Jara Uitto	Distributed Computing: 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009, Proceedings	Idit Keidar	2009	Springer Berlin Heidelberg
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs	Yong Zhang; Hong Zhu	Computing and Combinatorics: 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings	Kyung-Yong Chwa; Munro	2004	Springer Berlin Heidelberg
Minimum Vertex Cover		Optimization and approximation on systems of geometric objects	van Leeuwen E.	2009	CWI
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
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
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities	Rajiv Gandhi; Eran Halperin; Samir Khuller; Guy Kortsarz; Aravind Srinivasan	Automata, Languages and Programming: 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings	Jos C. M. Baeten; Jan Karel Lenstra; Joachim Parrow; Gerhard J. Woeginger	2003	Springer Berlin Heidelberg
An Improved Approximation Algorithm for Vertex Cover with Hard Capaciti		Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30 – July 4, 2003 Proceedings	Jan A. Bergstra, Inge Bethke (auth.), Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger (eds.)	2003	Springer-Verlag Berlin Heidelberg
New Approximation Algorithms for the Vertex Cover Problem	Franc̨ois Delbot; Christian Laforest; Raksmey Phan	Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers	Thierry Lecroq; Laurent Mouchard	2013	Springer Berlin Heidelberg
Approximation Algorithms for the Partition Vertex Cover Problem	Suman Kalyan Bera; Shalmoli Gupta; Amit Kumar; Sambuddha Roy	WALCOM: Algorithms and Computation: 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013, Proceedings	Subir Kumar Ghosh; Takeshi Tokuyama	2013	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
Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem	Zhiwen Fang; Yang Chu; Kan Qiao; Xu Feng; Ke Xu	Frontiers in Algorithmics: 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings	Jianer Chen; John E. Hopcroft; Jianxin Wang	2014	Springer International Publishing
Approximating Minimum Vertex Cover		Optimization and approximation on systems of geometric objects	van Leeuwen E.	2009	CWI
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem" - similar Books and Chapters