Advanced search
Start date
Betweenand

Investigation of hard problems from the algorithmic and structural stand points

Grant number: 15/11937-9
Support type:Research Projects - Thematic Grants
Duration: March 01, 2017 - February 28, 2022
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Theory of Computation
Principal Investigator:Flávio Keidi Miyazawa
Grantee:Flávio Keidi Miyazawa
Home Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
Co-Principal Investigators:Eduardo Candido Xavier ; Orlando Lee ; Yoshiko Wakabayashi ; Zanoni Dias
Assoc. researchers:Fábio Luiz Usberti ; Lehilton Lelis Chaves Pedrosa ; Luis Augusto Angelotti Meira ; Rafael Crivellari Saliba Schouery ; Ulisses Martins Dias
Associated grant(s):19/12728-5 - The study of theoretical and practical combinatorial optimization problems applied on real scenarios, AV.EXT
Associated scholarship(s):19/10400-2 - Approximation and parameterized algorithms for pair connectivity problems, BP.DR
19/14471-1 - Problems on spanners in graphs, BP.PD
19/27331-3 - Sorting by genome rearrangements problems, BP.PD
+ associated scholarships 19/14492-9 - Algorithmic game theory applied to transportation problems, BP.IC
18/25950-5 - An algorithm for the electrical vehicle routin problem, BP.MS
18/04679-1 - Conformal minors and Pfaffian orientations, BP.PD
17/26114-3 - Labelling problems on graphs, BP.PD
18/00910-0 - Algorithms for Min-Max p-hub location problems and variants, BP.IC
17/21297-2 - Advertisements scheduling problems, BP.MS
17/23623-4 - Partition problems in graphs and digraphs, BP.PD
17/23343-1 - Exact algorithms and heuristics for Car-Sharing, BP.MS
17/11831-1 - Algorithms and models for cutting and packing problems, BP.DD
17/05223-9 - Game-Theoretic analysis of transportation problems, BP.MS - associated scholarships

Abstract

The main theme of this project is the investigation of several problems on objects of discrete nature, with focus on their algorithmic, structural and theoretical aspects. We will give emphasis to the treatment of "hard problems" (formally known as NP-hard problems), but we will not restrict to this class of problems. We will also consider problems belonging to other complexity classes, as well as problems whose difficulty lies on the lack of information or on the decentralization of the decisions of different users, in contexts where the decision of an user affects the decision of the others. The algorithmic issues that will be investigated includes the design of efficient and practical algorithms (with performance guarantees, when possible), the development of new techniques, and the classification of several problems regarding their computational complexity. The structural and theoretical studies concerning the combinatorial objects that we will be carried out include their characterization, properties, conditions for their existence, counting and construction of these objects. The topics that we will investigate are interconnected and occur in several areas such as computational biology, discrete optimization, graph theory, logistics and economy. We expect that the research that will be conducted in this project will lead to relevant results, which will contribute to push forward the state of the art of the subject area. We also expect that this project will promote the academic formation of young researchers. Towards the end of the project, we envision an increase on the research activities in areas that are still little investigated in Brazil, but are intensively investigated in the main research centers abroad. (AU)

Scientific publications (30)
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
DE LIMA, MURILO SANTOS; SAN FELICE, MARIO CESAR; LEE, ORLANDO. Group parking permit problems. DISCRETE APPLIED MATHEMATICS, v. 281, n. SI, p. 172-194, JUL 15 2020. Web of Science Citations: 0.
MOURA, PHABLO F. S.; WAKABAYASHI, YOSHIKO. Strong intractability results for generalized convex recoloring problems. DISCRETE APPLIED MATHEMATICS, v. 281, n. SI, p. 252-260, JUL 15 2020. Web of Science Citations: 0.
BORGES, YULLE G. F.; MIYAZAWA, FLAVIO K.; SCHOUERY, RAFAEL C. S.; XAVIER, EDUARDO C. Exact algorithms for class-constrained packing problems. COMPUTERS & INDUSTRIAL ENGINEERING, v. 144, JUN 2020. Web of Science Citations: 0.
ALEXANDRINO, ALEXSANDRO OLIVEIRA; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. Sorting permutations by fragmentation-weighted operations. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, v. 18, n. 2 APR 2020. Web of Science Citations: 0.
GOMEZ, RENZO; WAKABAYASHI, YOSHIKO. Nontrivial path covers of graphs: existence, minimization and maximization. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 39, n. 2, p. 437-456, FEB 2020. Web of Science Citations: 0.
BRITO, KLAIRTON LIMA; JEAN, GERALDINE; FERTIN, GUILLAUME; OLIVEIRA, ANDRE RODRIGUES; DIAS, ULISSES; DIAS, ZANONI. Sorting by Genome Rearrangements on Both Gene Order and Intergenic Sizes. JOURNAL OF COMPUTATIONAL BIOLOGY, v. 27, n. 2 DEC 2019. Web of Science Citations: 0.
MUNOZ, JAVIER VARGAS; GONCALVES, MARCOS A.; DIAS, ZANONI; TORRES, RICARDO DA S. Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search. PATTERN RECOGNITION, v. 96, DEC 2019. Web of Science Citations: 0.
OLIVEIRA, ANDRE R.; JEAN, GERALDINE; FERTIN, GUILLAUME; DIAS, ULISSES; DIAS, ZANONI. Super short operations on both gene order and intergenic sizes. Algorithms for Molecular Biology, v. 14, n. 1 NOV 5 2019. Web of Science Citations: 0.
OLIVEIRA, ANDRE RODRIGUES; BRITO, KLAIRTON LIMA; DIAS, ULISSES; DIAS, ZANONI. On the Complexity of Sorting by Reversals and Transpositions Problems. JOURNAL OF COMPUTATIONAL BIOLOGY, v. 26, n. 11, p. 1223-1229, NOV 1 2019. Web of Science Citations: 1.
BORGES, YULLE G. F.; SCHOUERY, RAFAEL C. S.; MIYAZAWA, FLAVIO K.; GRANELLI, FABRIZIO; DA FONSECA, NELSON L. S.; MELO, LUCAS P. Smart energy pricing for demand-side management in renewable energy smart grids. International Transactions in Operational Research, v. 27, n. 6 NOV 2019. Web of Science Citations: 0.
GOMEZ, RENZO; WAKABAYASHI, YOSHIKO. Nontrivial path covers of graphs: existence, minimization and maximization. JOURNAL OF COMBINATORIAL OPTIMIZATION, NOV 2019. Web of Science Citations: 0.
SILVA, ANDRE C.; ARROYO, ALAN; RICHTER, R. BRUCE; LEE, ORLANDO. Graphs with at most one crossing. DISCRETE MATHEMATICS, v. 342, n. 11, p. 3201-3207, NOV 2019. Web of Science Citations: 0.
BENEDITO, MARCELO P. L.; PEDROSA, LEHILTON L. C. Approximation algorithms for Median Hub Location Problems. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 38, n. 2, p. 375-401, AUG 2019. Web of Science Citations: 0.
BOTLER, FABIO; SAMBINELLI, MAYCON; COELHO, RAFAEL S.; LEE, ORLANDO. Gallai's path decomposition conjecture for graphs with treewidth at most 3. JOURNAL OF GRAPH THEORY, AUG 2019. Web of Science Citations: 0.
LINTZMAYER, CARLA NEGRI; MIYAZAWA, FLAVIO KEIDI; XAVIER, EDUARDO CANDIDO. Online circle and sphere packing. THEORETICAL COMPUTER SCIENCE, v. 776, p. 75-94, JUL 12 2019. Web of Science Citations: 0.
SAMBINELLI, MAYCON; LINTZMAYER, CARLA NEGRI; DA SILVA, CANDIDA NUNES; LEE, ORLANDO. Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for Locally In-Semicomplete Digraphs. GRAPHS AND COMBINATORICS, v. 35, n. 4, p. 921-931, JUL 2019. Web of Science Citations: 0.
QUEIROZ, THIAGO A.; BRACHT, EVANDRO C.; MIYAZAWA, FLAVIO K.; BITTENCOURT, MARCO L. An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability. ENGINEERING OPTIMIZATION, v. 51, n. 6, p. 1049-1070, JUN 3 2019. Web of Science Citations: 1.
FERNANDES, CRISTINA G.; FERREIRA, CARLOS E.; MIYAZAWA, FLAVIO K.; WAKABAYASHI, YOSHIKO. Prices of Anarchy of Selfish 2D Bin Packing Games. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, v. 30, n. 3, p. 355-374, APR 2019. Web of Science Citations: 0.
SANTOS MIRANDA, GUILHERME HENRIQUE; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. Sorting Permutations by lambda-Operations. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, v. 25, n. 2, p. 98-121, 2019. Web of Science Citations: 0.
FERNANDES, CRISTINA G.; SCHOUERY, RAFAEL C. S. Approximation Algorithms for the Max-Buying Problem with Limited Supply. ALGORITHMICA, v. 80, n. 11, p. 2973-2992, NOV 2018. Web of Science Citations: 0.
YUCRA QUISPE, KENT E.; LINTZMAYER, CARLA N.; XAVIER, EDUARDO C. An exact algorithm for the Blocks Relocation Problem with new lower bounds. Computers & Operations Research, v. 99, p. 206-217, NOV 2018. Web of Science Citations: 4.
POVOA, MARCELO G.; XAVIER, EDUARDO C. Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems. International Transactions in Operational Research, v. 25, n. 5, p. 1417-1441, SEP 2018. Web of Science Citations: 0.
WAINER, JACQUES; XAVIER, EDUARDO C. A Controlled Experiment on Python vs C for an Introductory Programming Course: Student's Outcomes. ACM TRANSACTIONS ON COMPUTING EDUCATION, v. 18, n. 3 SEP 2018. Web of Science Citations: 0.
OLIVEIRA, ANDRE R.; FERTIN, GUILLAUME; DIAS, ULISSES; DIAS, ZANONI. Sorting signed circular permutations by super short operations. Algorithms for Molecular Biology, v. 13, JUL 26 2018. Web of Science Citations: 0.
PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S. Approximation algorithms for the bus evacuation problem. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 36, n. 1, p. 131-141, JUL 2018. Web of Science Citations: 0.
TICONA-ZEGARRA, EDSON; SCHOUERY, RAFAEL C. S.; VILLAS, LEANDRO A.; MIYAZAWA, FLAVIO K. Improved continuous enhancement routing solution for energy-aware data aggregation in wireless sensor networks. International Journal of Distributed Sensor Networks, v. 14, n. 5 MAY 11 2018. Web of Science Citations: 1.
LINTZMAYER, CARLA NEGRI; FERTIN, GUILLAUME; DIAS, ZANONI. Sorting permutations and binary strings by length-weighted rearrangements. THEORETICAL COMPUTER SCIENCE, v. 715, p. 35-59, MAR 8 2018. Web of Science Citations: 0.
C.H. SAMORA; F.L. USBERTI; C. LYRA. Relaxação Lagrangeana Aplicada ao Problema de Cobertura por Hubs. TEMA (São Carlos), v. 19, n. 3, p. -, Dez. 2018.
LINTZMAYER, CARLA NEGRI; FERTIN, GUILLAUME; DIAS, ZANONI. Sorting permutations by prefix and suffix rearrangements. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, v. 15, n. 1 FEB 2017. Web of Science Citations: 3.
OLIVEIRA, ANDRE RODRIGUES; DIAS, ULISSES; DIAS, ZANONI. On the Sorting by Reversals and Transpositions Problem. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, v. 23, n. 9, p. 868-906, 2017. Web of Science Citations: 1.

Please report errors in scientific publications list by writing to: cdi@fapesp.br.