Results 1 - 10 of 25

Approximation schemes for covering and packing problems in image processing and VLSI

by Dorit S. Hochbaum, Wolfgang Maass - J. ACM , 1985
"... A unified and powerful approach is presented for devising polynomial approximation schemes for many strongly NP-complete 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 NP-complete 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

by Nadia Hardy , 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 min-max bin covering problem

by Wenliang Du, Michael T. Goodrich, George Lueker - 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 k-anonymization problem, the means we investigate to perform this anonymization is to generalize values of quasi-identifying a ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
arbitrarily good polynomial-time approximations for a number of natural variations of the generalization technique, unless P = NP, even when the table has only a single quasi-identifying attribute that represents a geographic or unordered attribute: • Zip-codes: nodes of a planar graph generalized

Bidimensionality and EPTAS

by Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
"... Bidimensionality theory appears to be a powerful framework for the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005] as a tool to obtain sub-exponential time parameterized algorithms for problems on H-minor 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 EP-TASs. 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

by Moshe Dror, James B. Orlin - 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

by Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas, Allen Tucker, Teo Gonzales, Jorge L. Diaz-herrera, Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas , 2013
"... Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations in Sc ..."
Abstract - Add to MetaCart
Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations

0 GEOMETRIC APPROACH TO SAMPLING AND COMMUNICATION

by Emil Saucan, Eli Appleboim, Yehoshua, Y. Zeevi
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

c Copyright by

by Paul Sivilotti, Dong Xuan, Xiaodong Zhang, Hongwei Zhang
"... Messaging is a basic service in sensornets. Yet the unique system and application prop-erties 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 un-derstanding 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 dis-sertation is to identify the basic components of sensornet messaging and to study the re-lated algorithmic

Flush: A Reliable Bulk Transport Protocol for Multihop Wireless Networks

by unknown authors
"... We present Flush, a reliable, high goodput bulk data trans-port protocol for wireless sensor networks. Flush provides end-to-end reliability, reduces transfer time, and adapts to time-varying network conditions. It achieves these proper-ties using end-to-end acknowledgments, implicit snooping of con ..."
Abstract - Add to MetaCart
We present Flush, a reliable, high goodput bulk data trans-port protocol for wireless sensor networks. Flush provides end-to-end reliability, reduces transfer time, and adapts to time-varying network conditions. It achieves these proper-ties using end-to-end acknowledgments, implicit snooping

von

by Vom Promotionsausschuss Der, Technischen Universität Hamburg-harburg, Roman Kubrin , 2011
"... Diese Dissertation wurde vom Cuvillier Verlag Göttingen als Buch unter ISBN 978-3-95404-019-3 veröffentlicht (www.cuvillier.de). iContents ..."
Abstract - Add to MetaCart
Diese Dissertation wurde vom Cuvillier Verlag Göttingen als Buch unter ISBN 978-3-95404-019-3 veröffentlicht (www.cuvillier.de). iContents
Results 1 - 10 of 25