Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach

DOI10.1007/s40819-016-0216-1zbMath1397.90185arXiv1405.2199OpenAlexW1536530252MaRDI QIDQ1791804

Anita Pal, Madhumangal Pal

Publication date: 11 October 2018

Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.2199

zbMATH Keywords

modellinggraph theorygraph colouringinterval graphsdesign and analysis of algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
• The just-in-time scheduling problem in a flow-shop scheduling system
• An exact approach for the vertex coloring problem
• Graph colouring approaches for a satellite range scheduling problem
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms
• Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
• An optimal greedy heuristic to color interval graphs
• The graph coloring problem: A neuronal network approach
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
• A memetic algorithm for graph coloring
• Covering and coloring problems for relatives of intervals
• The maximum k-colorable subgraph problem for chordal graphs
• Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
• Optimal parallel 3-coloring algorithm for rooted trees and its applications
• The mutual exclusion scheduling problem for permutation and comparability graphs.
• A note on greedy algorithms for the maximum weighted independent set problem
• Incidence matrices and interval graphs
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• An ant-based algorithm for coloring graphs
• Coloring graphs by iterated local search traversing feasible and infeasible solutions
• An adaptive memory algorithm for the \(k\)-coloring problem
• An exact method for graph coloring
• A branch-and-cut algorithm for graph coloring
• Independent sets in triangle-free cubic planar graphs
• An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
• A Metaheuristic Approach for the Vertex Coloring Problem
• On the Maximum Independent Set Problem in Subclasses of Planar Graphs
• A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
• An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
• Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
• Faster algorithms for the shortest path problem
• Ant Local Search and its efficient adaptation to graph colouring
• Coloring planar graphs in parallel
• Fast Parallel Algorithms for Chordal Graphs
• Efficient algorithms for interval graphs and circular-arc graphs
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• An efficient algorithm to generate all maximal independent sets on trapezoid graphs
• A parallel algorithm to generate all maximal independent sets on permutation graphs
• Maximum weightk-independent set problem on permutation graphs
• A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
• Independent Sets of Maximum Weight in Apple-Free Graphs
• An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs

This page was built for publication: Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach