For graphs, given n,m and vertex functions f_1,\ldots,f_n, what is the complexity of finding an m-edge graph maximizing \sum_{i=1}^n f_i(d_i) when the functions are not…
Statement
For graphs, given n,m and vertex functions f_1,\ldots,f_n, what is the complexity of finding an m-edge graph maximizing \sum_{i=1}^n f_i(d_i) when the functions are not necessarily identical?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.