On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function

On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function

Bibliographic Details
Main Authors:	de Klerk, E, Pasechnik, D, Warners, J
Format:	Journal article
Published:	2004

Similar Items

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

On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs
by: Sotirov, R., et al.
Published: (2012)

Approximation of the stability number of a graph via copositive programming
by: de Klerk, E, et al.
Published: (2002)

Approximation of the stability number of a graph via copositive programming
by: Klerk, Etienne de., et al.
Published: (2011)

On the max-cut of sparse random graphs
by: Gamarnik, David, et al.
Published: (2019)

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

Max k-cut and judicious k-partitions
by: Bollobas, B, et al.
Published: (2010)

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

Max Cut for Random Graphs with a Planted Partition
by: Bollobás, B, et al.
Published: (2004)

Approximate graph colouring and the hollow shadow
by: Zivny, S, et al.
Published: (2023)

An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
by: Lee, Yin Tat, et al.
Published: (2015)

A note on the stability number of an orthogonality graph
by: de Klerk, E, et al.
Published: (2007)

Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
by: Karger, David R., et al.
Published: (2015)

A note on the stability number of an orthogonality graph
by: Klerk, Etienne de., et al.
Published: (2011)

Suboptimality of local algorithms for a class of max-cut problems
by: Chen, Wei-Kuo, et al.
Published: (2021)

Book drawings of complete bipartite graphs
by: de Klerk, E, et al.
Published: (2014)

Algorithms for Approximate Graph Coloring
by: Blum, Avrim
Published: (2023)

Improved lower bounds for book crossing numbers of complete graphs
by: de Klerk, E, et al.
Published: (2013)

On the Lovász theta−number of almost regular graphs with application to Erdös−Rényi graphs
by: Klerk, E, et al.
Published: (2009)

Exact and approximate inference in associative hierarchical networks using graph cuts
by: Russell, C, et al.
Published: (2010)

Pliability and approximating max-CSPs
by: Romero, M, et al.
Published: (2023)

Approximating Succinct MaxSat.
by: Schallhart, C, et al.
Published: (2005)

Improved lower bounds on book crossing numbers of complete graphs
by: Salazar, G., et al.
Published: (2014)

Contiguous cake cutting: Hardness results and approximation algorithms
by: Goldberg, PW, et al.
Published: (2020)

Contiguous cake cutting: hardness results and approximation algorithms
by: Goldberg, PW, et al.
Published: (2020)

PKC-θ function at the immunological synapse: prospects for therapeutic targeting.
by: Zanin-Zhorov, A, et al.
Published: (2011)

Breaking the nk barrier for minimum k-cut on simple graphs
by: He, Zhiyang, et al.
Published: (2022)

Measurement of the neutrino oscillation parameters sin²θ23, Δm²32, sin²θ13, and δCP in neutrino and antineutrino oscillation at T2K
by: Duffy, K
Published: (2016)

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

Colourings of random graphs
by: Heckel, A
Published: (2016)

Graph colourings and games
by: Meeks, KFT
Published: (2012)

Improper colourings of graphs
by: Kang, R
Published: (2008)

Almost perfect sequences with θ=2
by: Leung, Ka Hin, et al.
Published: (2013)

PKC-θ: hitting the bull's eye.
by: Dustin, M
Published: (2011)

Colour (approximate to age?) gradients in spiral galaxies
by: deJong, R
Published: (1996)

A faster algorithm for finding the minimum cut in a graph
Published: (2003)

Improved hardness for H-colourings of G-colourable graphs
by: Wrochna, M, et al.
Published: (2020)

On semidefinite programming relaxations of maximum k−section
by: de Klerk, E, et al.
Published: (2012)

On semidefinite programming relaxations of maximum k-section
by: De Klerk, E, et al.
Published: (2012)

Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
by: Scott, A, et al.
Published: (2006)