发布求助
文献互助 智能选刊 最新文献

Anais do Encontro de Teoria da Computação (ETC)最新文献

筛选
英文 中文
Algoritmos eficientes para emparelhamentos desconexos em grafos cordais e grafos bloco 弦图和块图中不连通配对的有效算法
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2019-07-02 DOI: 10.5753/etc.2019.6390
B. P. Masquio, P. Pinto, Jayme Szwarcfiter
{"title":"Algoritmos eficientes para emparelhamentos desconexos em grafos cordais e grafos bloco","authors":"B. P. Masquio, P. Pinto, Jayme Szwarcfiter","doi":"10.5753/etc.2019.6390","DOIUrl":"https://doi.org/10.5753/etc.2019.6390","url":null,"abstract":"Graph matching problems are well studied and bring great contributions to Graph Theory from both the theoretical and practical points of view. There are numerous studies for unrestricted and weighted/unweighted matchings. More recently, subgraph-restricted matchings have been proposed, which consider properties of the subgraph induced by the vertices of the matching. In this paper, we approach one of these new proposals, disconnected matching, which seeks to study maximum matching, such that the subgraph induced by the matching vertices is disconnected. We have described efficient algorithms to solve the problem for chordal graphs and block graphs based on a theoretical characterization.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132160472","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}
引用次数: 2
Number-On-Forehead Communication Complexity of Data Clustering with Sunflowers 向日葵数据聚类的数额通信复杂度
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2019-07-02 DOI: 10.5753/etc.2019.6394
Fabricio Mendoza-Granada, Marcos Villagra
{"title":"Number-On-Forehead Communication Complexity of Data Clustering with Sunflowers","authors":"Fabricio Mendoza-Granada, Marcos Villagra","doi":"10.5753/etc.2019.6394","DOIUrl":"https://doi.org/10.5753/etc.2019.6394","url":null,"abstract":"We study the problem of performing data clustering in a distributed setting, which is a problem that may arise in many practical areas such as machine learning and data analysis. The way in which the sites communicate and the way data is allocated define a model of communication. We develop a protocol to compute distributed clustering in the Number on Forehead model of communication complexity. In our model, we requiere that each site is aware of all clusters in its own data and all data allocated among sites define a sunflower. We show that there exists a two round communication protocol for data clustering where each site knows an to all clusters.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131841898","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}
引用次数: 0
Revising a Model of Crime and Punishment 修正一个罪与罚的模型
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2019-07-02 DOI: 10.5753/etc.2019.6401
Ariel Arbiser
{"title":"Revising a Model of Crime and Punishment","authors":"Ariel Arbiser","doi":"10.5753/etc.2019.6401","DOIUrl":"https://doi.org/10.5753/etc.2019.6401","url":null,"abstract":"We study a model of society consisting of agents and a government interacting according to decisions regarding cost-effective punishment of crime. We evaluate different strategies for the government in order to reduce the criminal activity, considering degrees of honesty and a possible cost for monitoring and apprehension. We extend a previous model by introducing a contagion effect for the degrees of honesty, and study properties which may lead to a crime-free society, including a game-theoretic formulation.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128848870","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}
引用次数: 0
A proof for Berges Dual Conjecture for Bipartite Digraphs 二部有向图的Berges对偶猜想的证明
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2019-07-02 DOI: 10.5753/etc.2019.6398
Caroline Aparecida de Paula Silva, C. N. D. Silva, Orlando Lee
{"title":"A proof for Berges Dual Conjecture for Bipartite Digraphs","authors":"Caroline Aparecida de Paula Silva, C. N. D. Silva, Orlando Lee","doi":"10.5753/etc.2019.6398","DOIUrl":"https://doi.org/10.5753/etc.2019.6398","url":null,"abstract":"Given a (vertex)-coloring C = C 1 , C 2 , ...C m of P a digraph D and a positive integer k, the k-norm of C is defined as C k = m i=1 min C i, k. A coloring C is k-optimal if its k-norm C k is minimum over all colorings. A (path) k-pack P k is a collection of at most k vertex-disjoint paths. A coloring C and a k-pack P k are orthogonal if each color class intersects as many paths as possible in P k , that is, if C i k, C i P j = 1 for every path P j P k , otherwise each vertex of C i lies in a different path of P k . In 1982, Berge conjectured that for every k-optimal coloring C there is a k-pack P k orthogonal to C. This conjecture is false for arbitrary digraphs, having a counterexample with odd cycle. In this paper we prove this conjecture for bipartite digraphs.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128387767","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
A Constant-Factor Approximation for the Generalized Cable-Trench Problem 广义电缆沟问题的常因子逼近
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2019-07-02 DOI: 10.5753/etc.2019.6399
M. P. Benedito, L. L. Pedrosa, H. K. Rosado
{"title":"A Constant-Factor Approximation for the Generalized Cable-Trench Problem","authors":"M. P. Benedito, L. L. Pedrosa, H. K. Rosado","doi":"10.5753/etc.2019.6399","DOIUrl":"https://doi.org/10.5753/etc.2019.6399","url":null,"abstract":"In the Cable-Trench Problem (CTP), the objective is to find a rooted spanning tree of a weighted graph that minimizes the length of the tree, scaled by a non-negative factor , plus the sum of all shortest-path lengths from the root, scaled by another non-negative factor. This is an intermediate optimization problem between the Single-Destination Shortest Path Problem and the Minimum Spanning Tree Problem. In this extended abstract, we consider the Generalized CTP (GCTP), in which some vertices need not be connected to the root, but may serve as cost-saving merging points; this variant also generalizes the Steiner Tree Problem. We present an 8.599-approximation algorithm for GCTP. Before this paper, no constant approximation for the standard CTP was known.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131530607","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}
引用次数: 2
Formulações e heurı́sticas para os problemas leasing k-median e leasing k-center Formulações e启发式问题分析租赁k-median e租赁k-center
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2019-07-02 DOI: 10.5753/etc.2019.6397
Jorge Amaral dos Santos, G. Londe, A. Ribeiro, Welverton Rodrigues da Silva
{"title":"Formulações e heurı́sticas para os problemas leasing k-median e leasing k-center","authors":"Jorge Amaral dos Santos, G. Londe, A. Ribeiro, Welverton Rodrigues da Silva","doi":"10.5753/etc.2019.6397","DOIUrl":"https://doi.org/10.5753/etc.2019.6397","url":null,"abstract":"Neste artigo, consideramos as generalizações dos problemas k-median e k-center, conhecidas, respectivamente, por leasing k-median (LKM) e leasing k-center (LKC). Apresentamos formulações de programação linear inteira e uma heurı́stica baseada na meta-heurı́stica BRKGA. Comparamos as soluções geradas pela heurı́stica com as soluções geradas pelo resolvedor GUROBI aplicado às formulações em programação linear, estabelecendo um prazo de 10 minutos de execução para ambos. Para as instâncias pequenas testadas, os custos das soluções heurı́sticas foram próximos aos custos ótimos (GAP médio ≤ 8%). Para instâncias maiores testadas a heurı́stica gerou soluções superiores às do resolvedor, em pelo menos metade dos testes.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"520 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132658337","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
Convexidade em Grafo Linha de Bipartido 图的凸性二部线
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2019-07-02 DOI: 10.5753/etc.2019.6403
V. Ponciano, R. S. Oliveira
{"title":"Convexidade em Grafo Linha de Bipartido","authors":"V. Ponciano, R. S. Oliveira","doi":"10.5753/etc.2019.6403","DOIUrl":"https://doi.org/10.5753/etc.2019.6403","url":null,"abstract":"For a nontrivial connected and simple graphs G= (V(G), E(G)), a set S E(G) is called edge geodetic set of G if every edge of G it’s in S or is contained in a geodesic joining some pair of edges in S. The edge geodetic number eds(G) of G is the minimum order of its edge geodetic sets. We prove that it is NP-complete to decide for a given bipartiti graphs G and a given integer k whether G has a edge geodetic set of cardinality at most k. A set M V(G) is called P3 set of G if all vertices of G have two neighbors in M. The P3 number of G is the minimum order of its P3 sets. We prove that it is NP-complete to decide for a given graphs G(diamond,odd-hole) free and a given integer k whether G has a P3 set of cardinality at most k.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132819565","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}
引用次数: 0
Two simplified versions of Red-Blue Facility Location 两个简化版本的红蓝设施位置
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2019-07-02 DOI: 10.5753/ETC.2019.6391
Cristina Fernandes, R. Pocai
{"title":"Two simplified versions of Red-Blue Facility Location","authors":"Cristina Fernandes, R. Pocai","doi":"10.5753/ETC.2019.6391","DOIUrl":"https://doi.org/10.5753/ETC.2019.6391","url":null,"abstract":"The Red-Blue Facility Location problem is a generalization of Facility Location where clients may have two types of demands and each open facility must provide for one of the types of demands. We present preliminary results for two special cases of this problem.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129532505","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}
引用次数: 0
Equitable Partition of Graphs into Independent Sets and Cliques 图的独立集和团的公平划分
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2019-07-02 DOI: 10.5753/etc.2019.6392
B. Monteiro, V. D. dos Santos
{"title":"Equitable Partition of Graphs into Independent Sets and Cliques","authors":"B. Monteiro, V. D. dos Santos","doi":"10.5753/etc.2019.6392","DOIUrl":"https://doi.org/10.5753/etc.2019.6392","url":null,"abstract":"A graph is (k, l) if its vertex set can be partitioned into k independent sets and l cliques. Deciding if a graph is (k, l) can be seen as a generalization of coloring, since deciding is a graph belongs to (k, 0) corresponds to deciding if a graph is k-colorable. A coloring is equitable if the cardinalities of the color classes differ by at most 1. In this paper, we generalize both the (k, l) and the equitable coloring problems, by showing that deciding whether a given graph can be equitably partitioned into k independent sets and l cliques is solvable in polynomial time if max(k, l) 2, and NP complete otherwise.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124752764","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
Um esquema de aproximação para um problema de empacotamento com cenários 一种带有情景的打包问题的近似方案
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2019-07-02 DOI: 10.5753/etc.2019.6400
Yulle G. F. Borges, Thiago Bergmann de Queiroz, V. Lima, F. K. Miyazawa, L. L. C. Pedrosa
{"title":"Um esquema de aproximação para um problema de empacotamento com cenários","authors":"Yulle G. F. Borges, Thiago Bergmann de Queiroz, V. Lima, F. K. Miyazawa, L. L. C. Pedrosa","doi":"10.5753/etc.2019.6400","DOIUrl":"https://doi.org/10.5753/etc.2019.6400","url":null,"abstract":"Investigamos um problema de empacotamento onde cada item possui um peso e está associado a um ou mais cenários e todos os recipientes têm uma capacidade fixa. Um empacotamento é uma atribuição de itens a recipientes de maneira que o peso total dos itens alocados a um recipiente para um mesmo cenário não ultrapasse a capacidade do recipiente. O objetivo do problema é encontrar um empacotamento de todos os itens em recipientes, de maneira a minimizar o número máximo de recipientes usados em qualquer cenário. Apre- sentamos um esquema de aproximação assintótico quando o número de cenários é limitado por uma constante.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133107162","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}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信