On the public citation graph

Approximation algorithms for the chromatic sum

0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190130310openalex-snapshot
Tight bounds on the chromatic sum of a connected graph
inferredcites →https://doi.org/10.1002/net.3230020104openalex-snapshot
Bounded color functions on graphs
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50015-5openalex-snapshot
GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.
inferredcites →https://doi.org/10.1016/c2013-0-12434-8openalex-snapshot
Graph Theory and Computing
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1016/s0304-0208(08)73557-6openalex-snapshot
Some Colouring Problems and their Complexity
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1145/75427.75430openalex-snapshot
An introduction to chromatic sums
inferredcites →https://doi.org/10.6028/jres.084.024openalex-snapshot
A graph coloring algorithm for large scheduling problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1998.0938openalex-snapshot
Minimum Color Sum of Bipartite Graphs
inferred← citeshttps://doi.org/10.1006/jagm.2000.1106openalex-snapshot
Sum Multicoloring of Graphs
inferred← citeshttps://doi.org/10.1006/jagm.2001.1210openalex-snapshot
Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_44openalex-snapshot
The Complexity of Tree Multicolorings
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_227openalex-snapshot
The minimum color sum of bipartite graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_2openalex-snapshot
Multicoloring: Problems and Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_5openalex-snapshot
Line System Design and a Generalized Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-71618-1_24openalex-snapshot
On Sum Coloring of Graphs with Parallel Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/pl00009252openalex-snapshot
On the Sum Coloring Problem on Interval Graphs
inferred← citeshttps://doi.org/10.1007/s00453-003-1031-8openalex-snapshot
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs
inferred← citeshttps://doi.org/10.1007/s10462-016-9485-7openalex-snapshot
Algorithms for the minimum sum coloring problem: a review
inferred← citeshttps://doi.org/10.1016/j.cor.2011.09.010openalex-snapshot
An effective heuristic algorithm for sum coloring of graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2019.05.010openalex-snapshot
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
inferred← citeshttps://doi.org/10.1016/j.dam.2013.09.025openalex-snapshot
On sum edge-coloring of regular, bipartite and split graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112391openalex-snapshot
Comparison of sum choice number with chromatic sum
inferred← citeshttps://doi.org/10.1016/j.ins.2016.02.051openalex-snapshot
Hybrid evolutionary search for the minimum sum coloring problem of graphs
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.009openalex-snapshot
Data migration to minimize the total completion time
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.08.002openalex-snapshot
On the performance guarantee of First Fit for sum coloring
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00249-4openalex-snapshot
On sum coloring of graphs
inferred← citeshttps://doi.org/10.1051/ro/2025142openalex-snapshot
An improved bi-criteria evolutionary approach for the sum coloring of graphs
inferred← citeshttps://doi.org/10.1145/195058.195221openalex-snapshot
Greed is good
inferred← citeshttps://doi.org/10.1201/9781351236423-38openalex-snapshot
Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs
inferred← citeshttps://doi.org/10.48550/arxiv.1303.6761openalex-snapshot
Improved Lower Bounds for Sum Coloring via Clique Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1909.08906openalex-snapshot
Lower Bound for (Sum) Coloring Problem
inferred← citeshttps://doi.org/10.51408/csit2023_31openalex-snapshot
An Upper Bound on the Edge-Chromatic Sum of Fibonacci Cubes
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.