138 search results - page 18 / 28 » Approximation Algorithms for Bounded Degree Phylogenetic Roo... |
WCNC
2010
IEEE
13 years 11 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
VC
2008
13 years 7 months ago
2008
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
APPROX
2005
Springer
14 years 29 days ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
IPCO
2010
13 years 8 months ago
2010
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...