Results 11  20
of
6,330
PTAS for Densest kSubgraph in Interval Graphs
, 2011
"... Given an interval graph and integer k, we consider the problem of finding a subgraph of size k with a maximum number of induced edges, called densest ksubgraph problem in interval graphs. It has been shown that this problem is NPhard even for chordal graphs [17], and there is probably no PTAS for ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
polynomialtime approximation scheme (PTAS), that is, we show that there is an (1 + ǫ)approximation algorithm for any ǫ> 0, which is the first such approximation scheme for the densest ksubgraph problem in an important graph class without any further restrictions. 1
A PTAS for the disk cover problem of geometric objects
"... We present PTASes for the disk cover problem: given geometric objects and a finite set of disk centers, minimize the total cost for covering those objects with disks under a polynomial cost function on the disks ’ radii. We describe the first FPTAS for covering a line segment when the disk centers f ..."
Abstract
 Add to MetaCart
We present PTASes for the disk cover problem: given geometric objects and a finite set of disk centers, minimize the total cost for covering those objects with disks under a polynomial cost function on the disks ’ radii. We describe the first FPTAS for covering a line segment when the disk centers
International Migration and Trade Agreements: the new role of PTAs
, 2013
"... This paper investigates empirically the role of Preferential Trade Agreements (PTAs) as determinants of migration inflows for 29 OECD countries in the period 19982008. By increasing information about signatory countries, PTAs are expected to drive migration flows towards member countries. Building ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper investigates empirically the role of Preferential Trade Agreements (PTAs) as determinants of migration inflows for 29 OECD countries in the period 19982008. By increasing information about signatory countries, PTAs are expected to drive migration flows towards member countries. Building
A PTAS for the Multiple Depot Vehicle Routing Problem
"... We design a simple PTAS for a multi depot capacitated vehicle routing problem. In this problem a set of customers and set of depots are represented by points in the Euclidean plane. Vehicles have capacities expressed in the number of customers that can be visited on one route starting and ending in ..."
Abstract
 Add to MetaCart
We design a simple PTAS for a multi depot capacitated vehicle routing problem. In this problem a set of customers and set of depots are represented by points in the Euclidean plane. Vehicles have capacities expressed in the number of customers that can be visited on one route starting and ending
PTAS for Ordered Instances of Resource Allocation Problems
, 2013
"... We consider the problem of fair allocation of indivisible goods where we are given a set I of m indivisible resources (items) and a set P of n customers (players) competing for the resources. Each resource j ∈ I has a same value vj> 0 for a subset of customers interested in j and it has no value ..."
Abstract
 Add to MetaCart
known as R   Cmax problem), the maximum utility is as low as possible. In this paper we are interested in instances of the problem that admit a PTAS. These instances are not only of theoretical interest but also have practical applications. For the MaxMin allocation problem, we start with instances
Multiobjective Disk Cover Admits a PTAS
"... We introduce multiobjective disk cover problems and study their approximability. We construct a polynomialtime approximation scheme (PTAS) for the multiobjective problem where k types of points (customers) in the plane have to be covered by disks (base stations) such that the number of disks is min ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce multiobjective disk cover problems and study their approximability. We construct a polynomialtime approximation scheme (PTAS) for the multiobjective problem where k types of points (customers) in the plane have to be covered by disks (base stations) such that the number of disks
Reconstruction of Tandem Repeat Histories with a PTAS
, 2000
"... Tandem Duplication is the process by which a stretch of DNA duplicates into two or more adjacent copies of itself, which are called tandem repeats. In consecutive generations of tandem duplications a stretch of DNA evolves to give multiple approximate copies in tandem to each other. Since duplicate ..."
Abstract
 Add to MetaCart
duplicated copies are preserved, it should be possible to reconstruct the history of duplications based on a metric. Benson [BD99] gave an algorithm towards this end that guaranteed an upper bound of 2 times the optimal history. In this thesis we present a PTAS to solve the Tandem Repeat History Problem
Turkey and Its Preferential Trade Agreements (PTAs)
, 2007
"... Since the adoption of the liberalization measures of 1980s, the establishment of Customs Union (CU) with the European Union (EU) has been the most important development in foreign trade relations of Turkey. In addition to the imposition of the Common Customs Tariff (CET), Turkey has to align her pre ..."
Abstract
 Add to MetaCart
commercial policy further with the EU’s. This paper reports the results from a comparative static global CGEGlobe model that quantifies the impact on Turkey of the EU – Turkey Customs Union, EFTA – Turkey and EuroMed countries – Turkey preferential trade agreements (PTAs). The macroeconomic implications
A QuasiPTAS for Unsplittable Flow on Line Graphs
"... ABSTRACT We study the Unsplittable Flow Problem (UFP) on line graphs andcycles, focusing on the longstanding open question of whether the problem is APXhard. We describe a deterministic quasipolynomialtime approximation scheme for UFP on line graphs, thereby ruling out an APXhardness result, unl ..."
Abstract
 Add to MetaCart
ABSTRACT We study the Unsplittable Flow Problem (UFP) on line graphs andcycles, focusing on the longstanding open question of whether the problem is APXhard. We describe a deterministic quasipolynomialtime approximation scheme for UFP on line graphs, thereby ruling out an APXhardness result, unless NP ` DTIME(2polylog(n)).Our result requires a quasipolynomial bound on all edge capacities and demands in the input instance. We extend this result toundirected cycle graphs. Earlier results on this problem included a polynomial time (2 + ")approximation under the assumption that no demand exceedsany edge capacity (the "nobottleneck assumption") and a superconstant integrality gap if this assumption did not hold. Unlikemost earlier work on UFP, our results do not require a nobottleneck assumption.
A PTAS for the Multiple Subset Sum Problem with Different Knapsack Capacities
"... We present a PTAS for the Multiple Subset Sum Problem (MSSP) with different knapsack capacities. This is the selection of items from a given ground set and their assignment to a given number of knapsacks such that the sum of the item weights in every knapsack does not exceed its capacity and the t ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We present a PTAS for the Multiple Subset Sum Problem (MSSP) with different knapsack capacities. This is the selection of items from a given ground set and their assignment to a given number of knapsacks such that the sum of the item weights in every knapsack does not exceed its capacity
Results 11  20
of
6,330