With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess
both a geographical location and a textual description are gaining in prevalence, and spatial …

We construct 2-query, quasi-linear size probabilistically checkable proofs (PCPs) with
arbitrarily small constant soundness, improving upon Dinur's 2-query quasi-linear size PCPs …

The Set Cover problem belongs to a group of hard problems which are neither
approximable in polynomial time (at least with a constant factor) nor fixed parameter …

Using ideas and results from polynomial time approximation and exact computation we
design approximation algorithms for several NP-hard combinatorial problems achieving …

We first devise a branching algorithm that computes a minimum independent dominating set
with running time O∗(1.3351 n)= O∗(20.417 n) and polynomial space. This improves upon …

In a software defined network (SDN), it is usually required to frequently collect state/statistics
of all the flows, which may result in large overhead on control links. To reduce the flow re …

In this paper we focus on problems inapproximable in polynomial time and explore how
quickly their approximability improves as the allowed running time is gradually increased …

We study in this note approximation algorithms for the problem of coloring the vertices of a
graph with as few colors as possible, with moderately exponential running times (and using …

The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be
labeled from 1 to n such that the labels of every pair of adjacent vertices differ by at most b …

Testing is an important activity for software projects. However, testing requires effort and
therefore creates so-called test costs. They consist of factors such as human effort for testing …