Pub Date : 2025-02-03DOI: 10.1016/j.jcss.2025.103632
Piotr Faliszewski , Piotr Skowron , Arkadii Slinko , Krzysztof Sornat , Stanisław Szufa , Nimrod Talmon
We introduce and study isomorphic distances between ordinal elections (with the same numbers of candidates and voters). The main feature of these distances is that they are invariant to renaming the candidates and voters, and two elections are at distance zero if and only if they are isomorphic. Specifically, we consider isomorphic extensions of distances between preference orders: Given such a distance d, we extend it to distance between elections by unifying candidate names and finding a matching between the votes, so that the sum of the d-distances between the matched votes is as small as possible. We show that testing isomorphism of two elections can be done in polynomial time so, in principle, such distances can be tractable. Yet, we show that two very natural isomorphic distances are NP-complete and hard to approximate. We attempt to rectify the situation by showing FPT algorithms for several natural parameterizations.
{"title":"How similar are two elections?","authors":"Piotr Faliszewski , Piotr Skowron , Arkadii Slinko , Krzysztof Sornat , Stanisław Szufa , Nimrod Talmon","doi":"10.1016/j.jcss.2025.103632","DOIUrl":"10.1016/j.jcss.2025.103632","url":null,"abstract":"<div><div>We introduce and study isomorphic distances between ordinal elections (with the same numbers of candidates and voters). The main feature of these distances is that they are invariant to renaming the candidates and voters, and two elections are at distance zero if and only if they are isomorphic. Specifically, we consider isomorphic extensions of distances between preference orders: Given such a distance <em>d</em>, we extend it to distance <span><math><mi>d</mi><mtext>-</mtext><mrow><mi>ID</mi></mrow></math></span> between elections by unifying candidate names and finding a matching between the votes, so that the sum of the <em>d</em>-distances between the matched votes is as small as possible. We show that testing isomorphism of two elections can be done in polynomial time so, in principle, such distances can be tractable. Yet, we show that two very natural isomorphic distances are NP-complete and hard to approximate. We attempt to rectify the situation by showing FPT algorithms for several natural parameterizations.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"150 ","pages":"Article 103632"},"PeriodicalIF":1.1,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143379331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-03DOI: 10.1016/j.jcss.2025.103630
George B. Mertzios , Hendrik Molter , Malte Renken , Paul G. Spirakis , Philipp Zschoche
In a temporal network with discrete time-labels on its edges, information can only “flow” along sequences of edges with non-decreasing (resp. increasing) time-labels. In this paper we make a first attempt to understand how the direction of information flow on one edge can impact the direction of information flow on other edges. By naturally extending the classical notion of a transitive orientation in static graphs, we introduce the fundamental notion of a temporal transitive orientation, and we systematically investigate its algorithmic behavior. Our main result is a conceptually simple, yet technically quite involved, polynomial-time algorithm for recognizing whether a temporal graph is transitively orientable. In wide contrast we prove that, surprisingly, it is NP-hard to recognize whether is strictly transitively orientable. Additionally we introduce further related problems to temporal transitivity, notably among them the temporal transitive completion problem, for which we prove both algorithmic and hardness results.
{"title":"The complexity of transitively orienting temporal graphs","authors":"George B. Mertzios , Hendrik Molter , Malte Renken , Paul G. Spirakis , Philipp Zschoche","doi":"10.1016/j.jcss.2025.103630","DOIUrl":"10.1016/j.jcss.2025.103630","url":null,"abstract":"<div><div>In a temporal network with discrete time-labels on its edges, information can only “flow” along sequences of edges with non-decreasing (resp. increasing) time-labels. In this paper we make a first attempt to understand how the direction of information flow on one edge can impact the direction of information flow on other edges. By naturally extending the classical notion of a transitive orientation in static graphs, we introduce the fundamental notion of a temporal transitive orientation, and we systematically investigate its algorithmic behavior. Our main result is a conceptually simple, yet technically quite involved, polynomial-time algorithm for recognizing whether a temporal graph <span><math><mi>G</mi></math></span> is transitively orientable. In wide contrast we prove that, surprisingly, it is NP-hard to recognize whether <span><math><mi>G</mi></math></span> is strictly transitively orientable. Additionally we introduce further related problems to temporal transitivity, notably among them the temporal transitive completion problem, for which we prove both algorithmic and hardness results.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"150 ","pages":"Article 103630"},"PeriodicalIF":1.1,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143377232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-21DOI: 10.1016/j.jcss.2025.103619
Cristina Bazgan , Katrin Casel , Pierre Cazals
We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of the subgraphs, where the density of a subgraph is half its average degree, that is, the ratio of its number of edges and its number of vertices. This problem, called Dense Graph Partition, is known to be NP-hard on general graphs and polynomial-time solvable on trees, and polynomial-time 2-approximable. In this paper we study the restriction of Dense Graph Partition to particular sparse and dense graph classes. In particular, we prove that it is NP-hard on dense bipartite graphs as well as on cubic graphs. On dense graphs on n vertices, it is polynomial-time solvable on graphs with minimum degree and NP-hard on -regular graphs. Some polynomial-time approximation results are also established.
{"title":"Dense graph partitioning on sparse and dense graphs","authors":"Cristina Bazgan , Katrin Casel , Pierre Cazals","doi":"10.1016/j.jcss.2025.103619","DOIUrl":"10.1016/j.jcss.2025.103619","url":null,"abstract":"<div><div>We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of the subgraphs, where the density of a subgraph is half its average degree, that is, the ratio of its number of edges and its number of vertices. This problem, called Dense Graph Partition, is known to be NP-hard on general graphs and polynomial-time solvable on trees, and polynomial-time 2-approximable. In this paper we study the restriction of Dense Graph Partition to particular sparse and dense graph classes. In particular, we prove that it is NP-hard on dense bipartite graphs as well as on cubic graphs. On dense graphs on <em>n</em> vertices, it is polynomial-time solvable on graphs with minimum degree <span><math><mi>n</mi><mo>−</mo><mn>3</mn></math></span> and NP-hard on <span><math><mo>(</mo><mi>n</mi><mo>−</mo><mn>4</mn><mo>)</mo></math></span>-regular graphs. Some polynomial-time approximation results are also established.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"150 ","pages":"Article 103619"},"PeriodicalIF":1.1,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we study temporal graphs arising from 1 dimensional mobility models, where vertices correspond to agents moving on a line and edges appear each time two agents meet. If each pair of agents meets exactly once, we get a simple temporal clique. In order to characterize such temporal cliques, we introduce the notion of forbidden patterns in temporal graphs. We extend the forbidden pattern characterization to simple mobility graphs (where each edge appears at most once) and to the analogous circular problem, where agents are moving along a circle. We also study the problem where pairs of agents are allowed to cross each other several times, using an approach from automata theory. We observe that in this case, there is no finite set of forbidden patterns that characterize such temporal graphs, nevertheless provide a linear time algorithm to recognize them.
{"title":"Forbidden patterns in temporal graphs resulting from encounters in a corridor","authors":"Mónika Csikós , Michel Habib , Minh-Hang Nguyen , Mikaël Rabie , Laurent Viennot","doi":"10.1016/j.jcss.2025.103620","DOIUrl":"10.1016/j.jcss.2025.103620","url":null,"abstract":"<div><div>In this paper, we study temporal graphs arising from 1 dimensional mobility models, where vertices correspond to agents moving on a line and edges appear each time two agents meet. If each pair of agents meets exactly once, we get a simple temporal clique. In order to characterize such temporal cliques, we introduce the notion of forbidden patterns in temporal graphs. We extend the forbidden pattern characterization to simple mobility graphs (where each edge appears at most once) and to the analogous circular problem, where agents are moving along a circle. We also study the problem where pairs of agents are allowed to cross each other several times, using an approach from automata theory. We observe that in this case, there is no finite set of forbidden patterns that characterize such temporal graphs, nevertheless provide a linear time algorithm to recognize them.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"150 ","pages":"Article 103620"},"PeriodicalIF":1.1,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-08DOI: 10.1016/j.jcss.2024.103618
Matthew Connor, Othon Michail
We study programmable matter systems consisting of modules that perform the minimal mechanical operation of rotating by 90° around each other. We represent the modules as nodes lying on the cells of a two-dimensional square grid. We are interested in characterising families whose shapes can be transformed into each other by a sequence of rotation moves that maintains global connectivity. Shapes can only be transformed into each other by rotation if they are colour-consistent, meaning that their nodes have identical colour cardinalities on a checkered colouring of the grid. We develop a generic centralised transformation and prove that, for any pair A, B of connected, colour-consistent, orthogonally convex shapes, it can transform A into B, using a seed of 3 or 4 nodes to trigger the transformation. The running time of our transformation is an optimal sequential moves, where .
{"title":"Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes","authors":"Matthew Connor, Othon Michail","doi":"10.1016/j.jcss.2024.103618","DOIUrl":"10.1016/j.jcss.2024.103618","url":null,"abstract":"<div><div>We study programmable matter systems consisting of modules that perform the minimal mechanical operation of rotating by 90° around each other. We represent the modules as nodes lying on the cells of a two-dimensional square grid. We are interested in characterising families whose shapes can be transformed into each other by a sequence of rotation moves that maintains global connectivity. Shapes can only be transformed into each other by rotation if they are <em>colour-consistent</em>, meaning that their nodes have identical colour cardinalities on a checkered colouring of the grid. We develop a generic centralised transformation and prove that, for any pair <em>A</em>, <em>B</em> of connected, colour-consistent, orthogonally convex shapes, it can transform <em>A</em> into <em>B</em>, using a <em>seed</em> of 3 or 4 nodes to trigger the transformation. The running time of our transformation is an optimal <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> sequential moves, where <span><math><mi>n</mi><mo>=</mo><mo>|</mo><mi>A</mi><mo>|</mo><mo>=</mo><mo>|</mo><mi>B</mi><mo>|</mo></math></span>.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"150 ","pages":"Article 103618"},"PeriodicalIF":1.1,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-07DOI: 10.1016/j.jcss.2024.103617
Eun Jung Kim , Euiwoong Lee , Dimitrios M. Thilikos
The Weighted -Vertex Deletion for a class of graphs asks, weighted graph G, for a minimum weight vertex set S such that . The case when is minor-closed and excludes some graph as a minor has received particular attention but a constant-factor approximation remained elusive for Weighted -Vertex Deletion. Only three cases of minor-closed are known to admit constant-factor approximations, namely Vertex Cover, Feedback Vertex Set and Diamond Hitting Set. We study the problem for the class of -minor-free graphs, under the equivalent setting of the Weightedc-Bond Cover problem, and present a constant-factor approximation algorithm using the primal-dual method. Besides making an important step in the quest of (dis)proving a constant-factor approximation for Weighted -Vertex Deletion, our result may be useful as a template for algorithms for other minor-closed families.
{"title":"A constant-factor approximation for weighted bond cover","authors":"Eun Jung Kim , Euiwoong Lee , Dimitrios M. Thilikos","doi":"10.1016/j.jcss.2024.103617","DOIUrl":"10.1016/j.jcss.2024.103617","url":null,"abstract":"<div><div>The <span>Weighted</span> <span><math><mi>F</mi></math></span>-<span>Vertex Deletion</span> for a class <span><math><mi>F</mi></math></span> of graphs asks, weighted graph <em>G</em>, for a minimum weight vertex set <em>S</em> such that <span><math><mi>G</mi><mo>−</mo><mi>S</mi><mo>∈</mo><mi>F</mi></math></span>. The case when <span><math><mi>F</mi></math></span> is minor-closed and excludes some graph as a minor has received particular attention but a constant-factor approximation remained elusive for <span>Weighted</span> <span><math><mi>F</mi></math></span>-<span>Vertex Deletion</span>. Only three cases of minor-closed <span><math><mi>F</mi></math></span> are known to admit constant-factor approximations, namely <span>Vertex Cover</span>, <span>Feedback Vertex Set</span> and <span>Diamond Hitting Set</span>. We study the problem for the class <span><math><mi>F</mi></math></span> of <span><math><msub><mrow><mi>θ</mi></mrow><mrow><mi>c</mi></mrow></msub></math></span>-minor-free graphs, under the equivalent setting of the <span>Weighted</span> <em>c</em><span>-Bond Cover</span> problem, and present a constant-factor approximation algorithm using the primal-dual method. Besides making an important step in the quest of (dis)proving a constant-factor approximation for <span>Weighted</span> <span><math><mi>F</mi></math></span>-<span>Vertex Deletion</span>, our result may be useful as a template for algorithms for other minor-closed families.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"149 ","pages":"Article 103617"},"PeriodicalIF":1.1,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143166231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-11DOI: 10.1016/j.jcss.2024.103615
Reijo Jaakkola , Antti Kuusisto , Miikka Vilander
We demonstrate novel links between entropy and description complexity, a notion referring to the minimal formula length for specifying given properties. Let PLC denote propositional logic with the ability to count assignments, and let be the fragment that counts only to one, essentially quantifying assignments. In the finite, is expressively complete for specifying sets of variable assignments, while PLC is expressively complete for multisets. We show that for both logics, the model classes with maximal Boltzmann entropy are the ones with maximal description complexity. Concerning PLC, we show that expected Boltzmann entropy is asymptotically equivalent to expected description complexity multiplied by the number of proposition symbols considered. For contrast, we prove this link breaks for first-order logic over vocabularies with higher-arity relations. Our results relate to links between Kolmogorov complexity and entropy, providing analogous results in the logic-based scenario with relational structures classified by formulas of different sizes.
{"title":"Relating description complexity to entropy","authors":"Reijo Jaakkola , Antti Kuusisto , Miikka Vilander","doi":"10.1016/j.jcss.2024.103615","DOIUrl":"10.1016/j.jcss.2024.103615","url":null,"abstract":"<div><div>We demonstrate novel links between entropy and description complexity, a notion referring to the minimal formula length for specifying given properties. Let PLC denote propositional logic with the ability to count assignments, and let <span><math><msup><mrow><mi>PLC</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span> be the fragment that counts only to one, essentially quantifying assignments. In the finite, <span><math><msup><mrow><mi>PLC</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span> is expressively complete for specifying sets of variable assignments, while PLC is expressively complete for multisets. We show that for both logics, the model classes with maximal Boltzmann entropy are the ones with maximal description complexity. Concerning PLC, we show that expected Boltzmann entropy is asymptotically equivalent to expected description complexity multiplied by the number of proposition symbols considered. For contrast, we prove this link breaks for first-order logic over vocabularies with higher-arity relations. Our results relate to links between Kolmogorov complexity and entropy, providing analogous results in the logic-based scenario with relational structures classified by formulas of different sizes.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"149 ","pages":"Article 103615"},"PeriodicalIF":1.1,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143166230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-11DOI: 10.1016/j.jcss.2024.103616
Andreea-Teodora Nász
The HOM-problem, which asks whether the image of a regular tree language under a tree homomorphism is again regular, is known to be decidable. In this paper, we prove the weighted HOM-problem for all fields decidable, provided that the tree homomorphism is tetris-free (a condition that generalizes injectivity). To this end, we reduce the problem to a property of the device representing the homomorphic image in question; to prove this property decidable, we then derive a pumping lemma for such devices from the well-known pumping lemma for regular tree series over fields, proved by Berstel and Reutenauer in 1982.
{"title":"The weighted HOM-problem over fields","authors":"Andreea-Teodora Nász","doi":"10.1016/j.jcss.2024.103616","DOIUrl":"10.1016/j.jcss.2024.103616","url":null,"abstract":"<div><div>The <em>HOM-problem</em>, which asks whether the image of a regular tree language under a tree homomorphism is again regular, is known to be decidable. In this paper, we prove the <em>weighted</em> HOM-problem for all fields decidable, provided that the tree homomorphism is <em>tetris-free</em> (a condition that generalizes injectivity). To this end, we reduce the problem to a property of the device representing the homomorphic image in question; to prove this property decidable, we then derive a pumping lemma for such devices from the well-known pumping lemma for regular tree series over fields, proved by Berstel and Reutenauer in 1982.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"149 ","pages":"Article 103616"},"PeriodicalIF":1.1,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143166232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-28DOI: 10.1016/j.jcss.2024.103606
Feodor F. Dragan , Guillaume Ducoffe , Heather M. Guarnera
A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. The class of Helly graphs is the discrete analogue of the class of hyperconvex metric spaces. We study diameter, radius and all eccentricity computations within the Helly graphs. Under plausible complexity assumptions, neither the diameter nor the radius can be computed in truly subquadratic time on general graphs. In contrast to these negative results, it was recently shown that the radius and the diameter of an n-vertex m-edge Helly graph can be computed with high probability in time (i.e., subquadratic in ). In this paper, we improve that result by presenting a deterministic -time algorithm which computes not only the radius and the diameter but also all vertex eccentricities in a Helly graph. Furthermore, we give a parameterized linear-time algorithm for this problem on Helly graphs, with the parameter being the Gromov hyperbolicity.
{"title":"Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs","authors":"Feodor F. Dragan , Guillaume Ducoffe , Heather M. Guarnera","doi":"10.1016/j.jcss.2024.103606","DOIUrl":"10.1016/j.jcss.2024.103606","url":null,"abstract":"<div><div>A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. The class of Helly graphs is the discrete analogue of the class of hyperconvex metric spaces. We study diameter, radius and all eccentricity computations within the Helly graphs. Under plausible complexity assumptions, neither the diameter nor the radius can be computed in truly subquadratic time on general graphs. In contrast to these negative results, it was recently shown that the radius and the diameter of an <em>n</em>-vertex <em>m</em>-edge Helly graph can be computed with high probability in <span><math><mover><mrow><mi>O</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><mi>m</mi><msqrt><mrow><mi>n</mi></mrow></msqrt><mo>)</mo></math></span> time (<em>i.e.</em>, subquadratic in <span><math><mi>n</mi><mo>+</mo><mi>m</mi></math></span>). In this paper, we improve that result by presenting a deterministic <span><math><mi>O</mi><mo>(</mo><mi>m</mi><msqrt><mrow><mi>n</mi></mrow></msqrt><mo>)</mo></math></span>-time algorithm which computes not only the radius and the diameter but also all vertex eccentricities in a Helly graph. Furthermore, we give a parameterized linear-time algorithm for this problem on Helly graphs, with the parameter being the Gromov hyperbolicity.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"149 ","pages":"Article 103606"},"PeriodicalIF":1.1,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143166229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-22DOI: 10.1016/j.jcss.2024.103605
George Karakostas , Stavros G. Kolliopoulos
Motivated by time-sharing systems with deadlines, we introduce the study of the following problem. We are given m machines and n jobs, as well as a set of tolerance capacities for every job j and machine i. Can we assign the jobs so that, if job j ends up on machine i, the total size of jobs that are processed on i is at most ? We define two natural optimization versions: (i) Maximize the total weight of jobs that can be assigned without violating the tolerance capacities. (ii) Minimize the amount by which capacities have to be scaled so that all jobs can be assigned. For (i), we provide constant-factor approximations even in the presence of additional side-constraints. For (ii), we provide a strong inapproximability result and integrality gap lower bounds for two key relaxations.
受有截止日期的分时系统的启发，我们引入了对以下问题的研究。我们给定了 m 台机器和 n 个作业，以及每个作业 j 和机器 i 的一组容差能力 uij≥0。我们能否分配作业，使作业 j 最终在机器 i 上处理时，在机器 i 上处理的作业的总大小最多为 uij？我们定义了两个自然优化版本：(i) 在不违反容差能力的情况下，最大化可分配作业的总重量。(ii) 最小化ρ≥1，ρ≥1 是为使所有工作都能分配而必须缩放的容量。对于 (i)，我们提供了恒因子近似值，即使存在额外的附带约束。对于 (ii)，我们提供了一个强大的不可逼近性结果和两个关键松弛的积分差距下限。
{"title":"Time-sharing scheduling with tolerance capacities","authors":"George Karakostas , Stavros G. Kolliopoulos","doi":"10.1016/j.jcss.2024.103605","DOIUrl":"10.1016/j.jcss.2024.103605","url":null,"abstract":"<div><div>Motivated by time-sharing systems with deadlines, we introduce the study of the following problem. We are given <em>m</em> machines and <em>n</em> jobs, as well as a set of <em>tolerance capacities</em> <span><math><msub><mrow><mi>u</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>≥</mo><mn>0</mn></math></span> for every job <em>j</em> and machine <em>i</em>. Can we assign the jobs so that, if job <em>j</em> ends up on machine <em>i</em>, the total size of jobs that are processed on <em>i</em> is at most <span><math><msub><mrow><mi>u</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msub></math></span>? We define two natural optimization versions: (i) Maximize the total weight of jobs that can be assigned without violating the tolerance capacities. (ii) Minimize the amount <span><math><mi>ρ</mi><mo>≥</mo><mn>1</mn></math></span> by which capacities have to be scaled so that all jobs can be assigned. For (i), we provide constant-factor approximations even in the presence of additional side-constraints. For (ii), we provide a strong inapproximability result and integrality gap lower bounds for two key relaxations.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"148 ","pages":"Article 103605"},"PeriodicalIF":1.1,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号