Sciweavers

106 search results - page 2 / 22
» Two Element Unavoidable Sets of Partial Words
Sort
View
DM
2011
238views Education» more  DM 2011»
12 years 11 months ago
A combinatorial approach to height sequences in finite partially ordered sets
Fix an element x of a finite partially ordered set P on n elements. Then let hi(x) be the number of linear extensions of P in which x is in position i, counting from the bottom. T...
Csaba Biró, William T. Trotter
ICALP
2001
Springer
13 years 9 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
SIAMSC
2008
188views more  SIAMSC 2008»
13 years 4 months ago
Adaptivity with Dynamic Meshes for Space-Time Finite Element Discretizations of Parabolic Equations
In this paper, we develop an error estimator and an adaptive algorithm for efficient solution of parabolic partial differential equations. The error estimator assesses the discreti...
Michael Schmich, Boris Vexler
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
13 years 8 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
CN
2008
108views more  CN 2008»
13 years 3 months ago
An approach to the identification of network elements composing heterogeneous end-to-end paths
Today's networks are becoming increasingly complex and the ability to effectively and efficiently operate and manage them is ever more challenging. Ways to provide end-to-end...
Alessio Botta, Antonio Pescapè, Giorgio Ven...