You're given a simple undirected graph G with N vertices and M edges. You have to assign, to each vertex i, a number C; such that 1 ≤ C; < N and Vi‡j, C; ‡ C₁. For any such assignment, we define D; to be the number of neighbours j of i such that C; < C₁. You want to minimise maxi{[1..N) Di - minic{1..N} Di. 3 Output the minimum possible value of this expression for a valid assignment as described above, and also print the corresponding assignment. Note: • The given graph need not be connected. • If there are multiple possible assignments, output anyone. • Since the input is large, prefer using fast input-output methods.
You're given a simple undirected graph G with N vertices and M edges. You have to assign, to each vertex i, a number C; such that 1 ≤ C; < N and Vi‡j, C; ‡ C₁. For any such assignment, we define D; to be the number of neighbours j of i such that C; < C₁. You want to minimise maxi{[1..N) Di - minic{1..N} Di. 3 Output the minimum possible value of this expression for a valid assignment as described above, and also print the corresponding assignment. Note: • The given graph need not be connected. • If there are multiple possible assignments, output anyone. • Since the input is large, prefer using fast input-output methods.
Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter18: Deterministic Dynamic Programming
Section18.4: Resource-allocation Problems
Problem 3P
Related questions
Question
100%
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole