Pages that link to "Item:Q1383159"

The following pages link to On chromatic sums and distributed resource allocation (Q1383159):

Displaying 48 items.

• Edge-chromatic sum of trees and bounded cyclicity graphs (Q294800) (← links)
• On a local protocol for concurrent file transfers (Q487273) (← links)
• Evaluation of monotone DNF formulas (Q521804) (← links)
• Bounds on contention management algorithms (Q553351) (← links)
• Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
• On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
• Max-optimal and sum-optimal labelings of graphs (Q763483) (← links)
• On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
• Time slot scheduling of compatible jobs (Q880586) (← links)
• Minimum sum edge colorings of multicycles (Q987666) (← links)
• Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
• Complexity results for minimum sum edge coloring (Q1028432) (← links)
• Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
• Multicoloring trees. (Q1401922) (← links)
• On the performance guarantee of first fit for sum coloring (Q1628787) (← links)
• Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
• Batch coloring of graphs (Q1755745) (← links)
• An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
• Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
• The maximum saving partition problem (Q1779697) (← links)
• On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application (Q1791912) (← links)
• On sum coloring of graphs (Q1811069) (← links)
• A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← links)
• A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
• Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
• Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
• A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs (Q2345859) (← links)
• Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
• Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
• On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
• OVSF-CDMA code assignment in wireless ad hoc networks (Q2471712) (← links)
• A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
• On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
• Certain chromatic sums of some cycle-related graph classes (Q2821116) (← links)
• Minimum sum coloring of \(P_{4}\)-sparse graphs (Q2840552) (← links)
• Batch Coloring of Graphs (Q2971156) (← links)
• Ignorant vs. Anonymous Recommendations (Q3452859) (← links)
• Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)
• Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) (← links)
• Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
• (Q4532754) (← links)
• A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
• (Q5091252) (← links)
• A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)
• On competitive recommendations (Q5964063) (← links)
• Parameterized algorithms for minimum sum vertex cover (Q6547957) (← links)
• An improved deterministic algorithm for the online min-sum set cover problem (Q6574926) (← links)
• On min sum vertex cover and generalized min sum set cover (Q6663094) (← links)