16 citations · 16 across the 3 of their papers we have counts for
4 papers
Approximation Algorithms for the -Matching and List-Restricted Variants of MaxQAP
Jiratchaphat Nanta, Vorapong Suppakitpaisarn, Piyashat Sripratak
We study approximation algorithms for two natural generalizations of the Maximum Quadratic Assignment Problem (MaxQAP). In the Maximum List-Restricted Quadratic Assignment Problem,…
Multipartite and Structural Results on Transparent Rectangle Visibility Graphs
Siraphob Buahong, Teeradej Kittipassorn, Jiratchaphat Nanta +2
We consider a graph representation in the plane, called the transparent rectangle visibility graph (TRVG), where each vertex is represented by a rectangle in the plane with sides p…
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
We consider domination analysis of approximation algorithms for the bipartite boolean quadratic programming problem (BBQP) with m+n variables. A closed form formula is developed to…
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem (QP0…