Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...