L15_ApproxAlgs
A new lower bound for the eternal vertex cover number of graphs | SpringerLink
An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem
Lower Bounds
Eulerian path - Wikipedia
Mathematics | Free Full-Text | Domination Coloring of Graphs
Mathematics | Free Full-Text | An Exact Algorithm for Minimum Vertex Cover Problem
Travelling Salesman Problem using Branch and Bound | Techie Delight
An Exact Algorithm for Minimum Vertex Cover Problem
Introduction to Complexity — Foundations of Computer Science 0.3 documentation
Analyze Geospatial Data in Python: GeoPandas and Shapely – LearnDataSci
DAA | Approximation Algorithm Vertex Cover - javatpoint
Lower Bounds Based on ETH
CS787: Advanced Algorithms Lecture 9: Approximation Algorithms In this lecture we will discuss some NP-complete optimization pro
Graph Theory - Part I | HackerEarth
Introduction and Approximate Solution for Vertex Cover Problem - GeeksforGeeks
graphs - Error lower-bound for an algorithm for vertex cover - Computer Science Stack Exchange
A substructure based lower bound for eternal vertex cover number - ScienceDirect
approximation - How are matchings a lower bound for an approximate vertex cover? - Computer Science Stack Exchange
Simple Bounds on Vertex Connectivity | Graph Theory - YouTube
ICS 46 Spring 2022, Notes and Examples: Graph Connectedness
A new lower bound for the eternal vertex cover number of graphs | SpringerLink
Intro to Algorithms: CHAPTER 37: APPROXIMATION ALGORITHMS
Graph hierarchy: a novel framework to analyse hierarchical structures in complex networks | Scientific Reports
complexity theory - How does one prove an upper/lower bound of a parallel algorithm? - Stack Overflow
