Maximum k-covering of weighted transitive graphs with applications
Maximum \(k\)-covering of weighted transitive graphs with applications
network flowVLSI layoutinteger sequencestransitive graph\(k\)-layer topological via minimizationmaximum \(k\)-independent set of interval graphsmaximum increasing \(k\)- subsequencemaximum multidimensional \(k\)-chain
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Stochastic network models in operations research (90B15) Applications of graph theory to circuits and networks (94C15)
- Algorithms for maximumk-colorings andk-coverings of transitive graphs
- Maximum weighted independent sets on transitive graphs and applications
- An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs
- Maximum weightk-independent set problem on permutation graphs
- Weighted maximum-clique transversal sets of graphs
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3898776 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4039253 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A fast algorithm for computing longest common subsequences
- Algorithms for maximumk-colorings andk-coverings of transitive graphs
- An Optimal Algorithm for the Maximum Two-Chain Problem
- An Optimal Solution for the Channel-Assignment Problem
- An efficient algorithm for maxdominance, with applications
- Channel routing in knock-knee mode: Simplified algorithms and proofs
- Channel routing of multiterminal nets
- Circular permutation graph family with applications
- Efficient algorithms for interval graphs and circular-arc graphs
- On Comparability and Permutation Graphs
- Optimal Three-Layer Channel Routing
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Maximum weighted independent sets on transitive graphs and applications
- scientific article; zbMATH DE number 6000604 (Why is no real title available?)
- Algorithms for maximumk-colorings andk-coverings of transitive graphs
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Just-in-time scheduling with controllable processing times on parallel machines
- The just-in-time scheduling problem in a flow-shop scheduling system
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Optimal channel allocation for several types of cellular radio networks
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
This page was built for publication: Maximum \(k\)-covering of weighted transitive graphs with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207331)
