|
|
|
|
|
Tapani Toivonen and Markku Tukiainen
Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such a problem is maximum clique, which?under standard assumptions in complexity theory?cannot be solved in sub-exponential time...
ver más
|
|
|
|
|
|
|
|
|
|
|
Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen Kobourov, Giuseppe Liotta, Alfredo Navarra and Alessandra Tappini
This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique. h-Clique2Path Plan...
ver más
|
|
|
|
|
|
|
|
|
|
|
Leandro do C. Martins, Christopher Bayliss, Pedro J. Copado-Méndez, Javier Panadero and Angel A. Juan
Advances in information and communication technologies have made possible the emergence of new shopping channels. The so-called ?omnichannel? retailing mode allows customers to shop for products online and receive them at home. This paper focuses on the ...
ver más
|
|
|
|
|
|