Structural parameters for scheduling with assignment restrictions (Q2205947): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Structural Parameters for Scheduling with Assignment Restrictions
description / endescription / en
 
scientific article; zbMATH DE number 6751075
Property / title
 
Structural Parameters for Scheduling with Assignment Restrictions (English)
Property / title: Structural Parameters for Scheduling with Assignment Restrictions (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1486.90093 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-57586-5_30 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
21 July 2017
Timestamp+2017-07-21T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 21 July 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6751075 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2581693535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction with bounded treewidth revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph balancing: a special case of scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graph balancing problems with restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel machines with inclusive processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with nested job assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and fixed-parameter tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural parameters for scheduling with assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Algorithm for Restricted Max-Min Fair Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-norm approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaxMin allocation via degree lower-bounded arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Allocating Goods to Maximize Fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Max-Min Fair Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P<sub>6</sub>-FREE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Configuration-LP of the Restricted Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-polynomial approximation for the restricted assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for Ordered Instances of Resource Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling meets \(n\)-fold integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An EPTAS for scheduling on unrelated machines of few different types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of machine scheduling: 15 open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Santa Claus Schedules Jobs on Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank

Latest revision as of 20:46, 23 July 2024

scientific article; zbMATH DE number 6751075
  • Structural Parameters for Scheduling with Assignment Restrictions
Language Label Description Also known as
English
Structural parameters for scheduling with assignment restrictions
scientific article; zbMATH DE number 6751075
  • Structural Parameters for Scheduling with Assignment Restrictions

Statements

Structural parameters for scheduling with assignment restrictions (English)
0 references
Structural Parameters for Scheduling with Assignment Restrictions (English)
0 references
0 references
0 references
0 references
21 October 2020
0 references
21 July 2017
0 references
scheduling
0 references
approximation
0 references
approximation scheme
0 references
FPT algorithm
0 references
treewidth
0 references
cliquewidth
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references