Algorithms for Approximate Graph Coloring

Algorithms for Approximate Graph Coloring

Bibliographic Details
Main Author:	Blum, Avrim
Other Authors:	Rivest, Ronald L.
Published:	2023
Online Access:	https://hdl.handle.net/1721.1/149708

Similar Items

Hybrid quantum-classical algorithms for approximate graph coloring
by: Sergey Bravyi, et al.
Published: (2022-03-01)

Decomposition, approximation, and coloring of odd-minor-free graphs
by: Demaine, Erik D., et al.
Published: (2011)

Approximating chromatic sum coloring of bipartite graphs in expected polynomial time
by: A. S. Asratian, et al.
Published: (2018-10-01)

Correlations and the ridge in the Color Glass Condensate beyond the glasma graph approximation
by: Tolga Altinoluk, et al.
Published: (2018-05-01)

Algorithms and Hardness for Approximating the Diameter of a Graph
by: Wein, Nicole Spence
Published: (2022)

An expected polynomial time algorithm for coloring 2-colorable 3-graphs
by: Yury Person, et al.
Published: (2011-05-01)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Hanna Furmańczyk, et al.
Published: (2022-11-01)

Structural rounding: Approximation algorithms for graphs near an algorithmically tractable class
by: Demaine, Erik D, et al.
Published: (2020)

Sparse approximations, iterative methods, and faster algorithms for matrices and graphs
by: Cohen, Michael Benjamin
Published: (2018)

Tight approximation algorithms for bichromatic graph diameter and related problems
by: Dalirrooyfard, Mina, et al.
Published: (2021)

Conditionally optimal approximation algorithms for the girth of a directed graph
by: Dalirrooyfard, Mina, et al.
Published: (2021)

Graph cuts with interacting edge weights: examples, approximations, and algorithms
by: Bilmes, Jeff A., et al.
Published: (2017)

Genetic algorithm for black and white coloring problem on graphs
by: Luis Eduardo Urván Rivero, et al.
Published: (2018-02-01)

A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM
by: Román Anselmo Mora Gutiérrez, et al.
Published: (2016-08-01)

COMPARATIVE ANALYSIS OF COLORING ALGORITHMS FOR ORDINARY WEIGHTED GRAPH
by: Andrey Sergeyevich Merzlenko, et al.
Published: (2014-06-01)

Approximations of Acyclic Graphs
by: N.D. Markhabatov
Published: (2022-06-01)

Topology and Graph in Graph Coloring
Published: (2021-05-01)

Approximation algorithms for multi-multiway cut and multicut problems on directed graphs
by: Ramin Yarinezhad, et al.
Published: (2020-09-01)

An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs
by: Robbie King
Published: (2023-11-01)

Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
by: Moitra, Ankur
Published: (2010)

Approximating cycles in directed graphs: Fast algorithms for girth and roundtrip spanners
by: Pachocki, J, et al.
Published: (2021)

Approximating cycles in directed graphs: Fast algorithms for girth and roundtrip spanners
by: Pachocki, J, et al.
Published: (2022)

Approximation algorithms via structural results for apex-minor-free graphs
by: Demaine, Erik D., et al.
Published: (2011)

A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
by: Badoiu, Mihai, et al.
Published: (2005)

A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
by: Badoiu, Mihai, et al.
Published: (2004)

Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
by: Mustapha Kchikech, et al.
Published: (2006-01-01)

Modified PSO algorithm for solving planar graph coloring problem/
by: 496442 Cui, Guangzhao, et al.

Solving the graph coloring problem via hybrid genetic algorithms
by: Sidi Mohamed Douiri, et al.
Published: (2015-01-01)

Heuristic Algorithm for Graph Coloring Based On Maximum Independent Set
by: Hilal ALMARA’BEH, et al.
Published: (2012-01-01)

Approximations of Metric Graphs by Thick Graphs and Their Laplacians
by: Olaf Post
Published: (2019-03-01)

Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python
by: Arifin, Samsul, et al.
Published: (2022)

Approximate graph colouring and crystals
by: Ciardo, L, et al.
Published: (2023)

Distributed Graph Diameter Approximation
by: Matteo Ceccarello, et al.
Published: (2020-09-01)

Graph clustering by congruency approximation
by: Weiya Ren, et al.
Published: (2015-12-01)

On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function
by: de Klerk, E, et al.
Published: (2004)

Fast construction of discrete geodesic graph as generalized discrete geodesic approximation algorithms
by: Adikusuma, Yohanes Yudhi, et al.
Published: (2017)

On approximate graph colouring and max-k-cut algorithms based on the θ-function
by: Klerk, Etienne de., et al.
Published: (2013)

A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights
by: Daniel R. Page, et al.
Published: (2016-06-01)

Planar Graphs And Coloring
by: Manogaran, Lavaneesvari
Published: (2010)

On Fall-Colorable Graphs
by: Shaojun Wang, et al.
Published: (2024-04-01)