Approximation Algorithms in Graphs with Known Broadcast Time of the Base Graph.
Puspal BhabakHovhannes A. HarutyunyanPublished in: CALDAM (2022)
Keyphrases
- approximation algorithms
- undirected graph
- adjacency matrix
- special case
- np hard
- graph representation
- minimum cost
- random graphs
- directed graph
- graph matching
- graph model
- graph theory
- vertex cover
- weighted graph
- graph theoretic
- graph construction
- constant factor
- graph databases
- labeled graphs
- graph structure
- graph mining
- spanning tree
- worst case
- graph clustering
- graph structures
- disjoint paths
- planar graphs
- graph properties
- graph partitioning
- facility location problem
- subgraph isomorphism
- open shop
- network design problem
- approximation ratio
- bipartite graph
- graph data
- edge weights
- dynamic graph
- minimum spanning tree
- approximation schemes
- randomized algorithms
- approximation guarantees
- primal dual
- graph kernels
- connected graphs
- set cover
- np hardness
- integer programming
- branch and bound algorithm
- random walk