Results 1  10
of
25
Approximation schemes for covering and packing problems in image processing and VLSI
 J. ACM
, 1985
"... A unified and powerful approach is presented for devising polynomial approximation schemes for many strongly NPcomplete problems. Such schemes consist of families of approximation algorithms for each desired performance bound on the relative error c> 0, with running time that is polynomial whe ..."
Abstract

Cited by 249 (0 self)
 Add to MetaCart
A unified and powerful approach is presented for devising polynomial approximation schemes for many strongly NPcomplete problems. Such schemes consist of families of approximation algorithms for each desired performance bound on the relative error c> 0, with running time that is polynomial
Odd cycles in planar graphs
, 2005
"... Given a graph G = (V,E), an odd cycle cover is a subset of the vertices whose removal makes the graph bipartite, that is, it meets all odd cycles in G. A packing in G is a collection of vertex disjoint odd cycles. This thesis addresses algorithmic and structural problems concerning odd cycle covers ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
prove here that τ ≤ 10ν for planar graphs. Our structural results leads to the first constant approximation algorithm for the packing problem. The covering problem was shown to be tractable for graphs of constant sized solutions [42]. We give a linear time algorithm for the covering problem restricted
On the approximability of geometric and geographic generalization and the minmax bin covering problem
 In WADS
, 2009
"... We study the problem of abstracting a table of data about individuals so that no selection query can identify fewer than k individuals. As is common in existing work on this kanonymization problem, the means we investigate to perform this anonymization is to generalize values of quasiidentifying a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
arbitrarily good polynomialtime approximations for a number of natural variations of the generalization technique, unless P = NP, even when the table has only a single quasiidentifying attribute that represents a geographic or unordered attribute: • Zipcodes: nodes of a planar graph generalized
Bidimensionality and EPTAS
"... Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005] as a tool to obtain subexponential time parameterized algorithms for problems on Hminor free graphs. Demaine and Hajiaghayi [SODA 2005] e ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
] extended the theory to obtain polynomial time approximation schemes (PTASs) for bidimensional problems, and subsequently improved these results to EPTASs. Fomin et. al [SODA 2010] established a third metaalgorithmic direction for bidimensionality theory by relating it to the existence of linear kernels
Combinatorial optimization with explicit delineation of the ground set by a collection of subsets
 In SIAM J. Discrete Math
, 2008
"... We examine a selective list of combinatorial optimization problems in NP with respect to inapproximability (Arora and Lund, 1997) given that the ground set of elements N has additional characteristics. For each problem in this paper, the set N is expressed explicitly by subsets of N either as a part ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
problems the existence of PTAS (polynomial time approximation scheme) is impossible unless P=NP. This suggests a partial characterization for a family of inapproximable problems. For the generalized Euclidean TSP we prove inapproximability even if the subsets are of cardinality two.
Volume I: Computer Science and Software Engineering
, 2013
"... Algebraic algorithms deal with numbers, vectors, matrices, polynomials, formal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matrices and polynomials is fundamental for modern computations in Sc ..."
Abstract
 Add to MetaCart
Algebraic algorithms deal with numbers, vectors, matrices, polynomials, formal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matrices and polynomials is fundamental for modern computations
c Copyright by
"... Messaging is a basic service in sensornets. Yet the unique system and application properties of sensornets pose substantial challenges for the messaging design: Firstly, dynamic wireless links, constrained resources, and application diversity challenge the architecture and protocol design of sensor ..."
Abstract
 Add to MetaCart
, the lack of a basic understanding of its essential components has been an obstacle for reliable, efcient, and reusable messaging services in sensornets. To address this problem, one task of this dissertation is to identify the basic components of sensornet messaging and to study the related algorithmic
Flush: A Reliable Bulk Transport Protocol for Multihop Wireless Networks
"... We present Flush, a reliable, high goodput bulk data transport protocol for wireless sensor networks. Flush provides endtoend reliability, reduces transfer time, and adapts to timevarying network conditions. It achieves these properties using endtoend acknowledgments, implicit snooping of con ..."
Abstract
 Add to MetaCart
We present Flush, a reliable, high goodput bulk data transport protocol for wireless sensor networks. Flush provides endtoend reliability, reduces transfer time, and adapts to timevarying network conditions. It achieves these properties using endtoend acknowledgments, implicit snooping
von
, 2011
"... Diese Dissertation wurde vom Cuvillier Verlag Göttingen als Buch unter ISBN 9783954040193 veröffentlicht (www.cuvillier.de). iContents ..."
Abstract
 Add to MetaCart
Diese Dissertation wurde vom Cuvillier Verlag Göttingen als Buch unter ISBN 9783954040193 veröffentlicht (www.cuvillier.de). iContents
Results 1  10
of
25