Foundations of Software Technology and Theoretical Computer Science最新文献_第9页

Probabilistic Mu-Calculus: Decidability and Complete Axiomatization 概率mu微积分:可决性与完全公理化

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-12-01 DOI: 10.4230/LIPIcs.FSTTCS.2016.25

K. Larsen, R. Mardare, Bingtian Xue

引用次数: 5

Admissibility in Quantitative Graph Games 定量图游戏的可采性

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-11-26 DOI: 10.4230/LIPIcs.FSTTCS.2016.42

Romain Brenguier, G. Pérez, Jean-François Raskin, O. Sankur

引用次数: 15

Approximation Algorithms for Stochastic k-TSP 随机k-TSP的近似算法

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-10-01 DOI: 10.4230/LIPIcs.FSTTCS.2017.27

Alina Ene, V. Nagarajan, Rishi Saket

引用次数: 15

PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions 包含限制的资源分配问题的有序实例的PTAS

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-10-01 DOI: 10.4230/LIPIcs.FSTTCS.2013.461

K. Khodamoradi, Ramesh Krishnamurti, A. Rafiey, G. Stamoulis

{"title":"PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions","authors":"K. Khodamoradi, Ramesh Krishnamurti, A. Rafiey, G. Stamoulis","doi":"10.4230/LIPIcs.FSTTCS.2013.461","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2013.461","url":null,"abstract":"We consider the problem of fair allocation of indivisible goods where \u0000we are given a set I of m indivisible resources (items) and a set P of n customers (players) competing for the resources. Each resource \u0000j in I has a same value vj > 0 for a subset of customers interested in j and it has no value for other customers. The goal is to find a feasible allocation of the resources to the interested customers such that in the Max-Min scenario (also known as Santa Claus problem) the minimum utility (sum of the resources) received by each of the customers is as high as possible and in the Min-Max case (also known as R||C_max problem), the maximum utility is as low as possible. \u0000 \u0000In this paper we are interested in instances of the problem that admit a PTAS. These instances are not only of theoretical interest but also have practical applications. For the Max-Min allocation problem, we start with instances of the problem that can be viewed as a convex bipartite graph; there exists an ordering of the resources such that each customer is interested (has positive evaluation) in a set of consecutive resources and we demonstrate a PTAS. For the Min-Max allocation problem, we obtain a PTAS for instances in which there is an ordering of the customers (machines) and each resource (job) is adjacent to a consecutive set of customers (machines). \u0000Next we show that our method for the Max-Min scenario, can be extended to a broader class of bipartite graphs where the resources can be viewed as a tree and each customer is interested in a sub-tree of a bounded number of leaves of this tree (e.g. a sub-path).","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115394786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Popular Matchings with Multiple Partners 与多个合作伙伴的流行匹配

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-09-23 DOI: 10.4230/LIPIcs.FSTTCS.2017.19

F. Brandl, T. Kavitha

引用次数: 14

On the Sensitivity Conjecture for Disjunctive Normal Forms 析取范式的灵敏度猜想

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-07-18 DOI: 10.4230/LIPIcs.FSTTCS.2016.15

S. KarthikC., Sébastien Tavenas

引用次数: 10

Mean-Payoff Games on Timed Automata 基于时间自动机的平均收益游戏

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-07-01 DOI: 10.4230/LIPIcs.FSTTCS.2016.44

Shibashis Guha, M. Jurdzinski, S. Krishna, Ashutosh Trivedi

引用次数: 2

FO-Definable Transformations of Infinite Strings 无穷弦的fo可定义变换

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-07-01 DOI: 10.4230/LIPIcs.FSTTCS.2016.12

V. Dave, S. Krishna, Ashutosh Trivedi

{"title":"FO-Definable Transformations of Infinite Strings","authors":"V. Dave, S. Krishna, Ashutosh Trivedi","doi":"10.4230/LIPIcs.FSTTCS.2016.12","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2016.12","url":null,"abstract":"The theory of regular and aperiodic transformations of finite strings has recently received a lot of interest. These classes can be equivalently defined using logic (Monadic second-order logic and first-order logic), two-way machines (regular two-way and aperiodic two-way transducers), and one-way register machines (regular streaming string and aperiodic streaming string transducers). These classes are known to be closed under operations such as sequential composition and regular (star-free) choice; and problems such as functional equivalence and type checking, are decidable for these classes. On the other hand, for infinite strings these results are only known for $omega$-regular transformations: Alur, Filiot, and Trivedi studied transformations of infinite strings and introduced an extension of streaming string transducers over $omega$-strings and showed that they capture monadic second-order definable transformations for infinite strings. In this paper we extend their work to recover connection for infinite strings among first-order logic definable transformations, aperiodic two-way transducers, and aperiodic streaming string transducers.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133928331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem 均匀硬容量背包中值问题的常因子逼近算法

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-06-26 DOI: 10.4230/LIPIcs.FSTTCS.2018.23

Sapna Grover, Neelima Gupta, S. Khuller, Aditya Pancholi

{"title":"Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem","authors":"Sapna Grover, Neelima Gupta, S. Khuller, Aditya Pancholi","doi":"10.4230/LIPIcs.FSTTCS.2018.23","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2018.23","url":null,"abstract":"In this paper, we give first constant factor approximation for capacitated knapsack median problem (CKM) for hard uniform capacities, violating the budget only by an additive factor of $f_{max}$ where $f_{max}$ is the maximum cost of a facility opened by the optimal and violating capacities by $(2+epsilon)$ factor. Natural LP for the problem is known to have an unbounded integrality gap when any one of the two constraints is allowed to be violated by a factor less than $2$. Thus, we present a result which is very close to the best achievable from the natural LP. To the best of our knowledge, the problem has not been studied earlier. For capacitated facility location problem with uniform capacities, a constant factor approximation algorithm is presented violating the capacities a little ($1 + epsilon$). Though constant factor results are known for the problem without violating the capacities, the result is interesting as it is obtained by rounding the solution to the natural LP, which is known to have an unbounded integrality gap without violating the capacities. Thus, we achieve the best possible from the natural LP for the problem. The result shows that natural LP is not too bad. Finally, we raise some issues with the proofs of the results presented in cite{capkmByrkaFRS2013} for capacitated $k$-facility location problem (C$k$FLP). cite{capkmByrkaFRS2013} presents $O(1/epsilon^2)$ approximation violating the capacities by a factor of $(2 + epsilon)$ using dependent rounding. We first fix these issues using our techniques. Also, it can be argued that (deterministic) pipage rounding cannot be used to open the facilities instead of dependent rounding. Our techniques for CKM provide a constant factor approximation for CkFLP violating the capacities by $(2 + epsilon)$.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127649489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Summaries for Context-Free Games 无情境游戏的总结

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-03-01 DOI: 10.4230/LIPIcs.FSTTCS.2016.41

L. Holík, R. Meyer, Sebastian Muskalla

引用次数: 4