Sciweavers

1368 search results - page 79 / 274
» Generalized Rook Polynomials
Sort
View
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 5 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
CAGD
2006
73views more  CAGD 2006»
15 years 4 months ago
Rational surfaces with linear normals and their convolutions with rational surfaces
It is shown that polynomial (or rational) parametric surfaces with a linear field of normal vectors are dual to graphs bivariate polynomials (or rational functions). We discuss th...
Maria Lucia Sampoli, Martin Peternell, Bert Jü...
108
Voted
MP
2006
121views more  MP 2006»
15 years 4 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg
MOC
2000
137views more  MOC 2000»
15 years 4 months ago
The apolar bilinear form in geometric modeling
Some recent methods of Computer Aided Geometric Design are related to the apolar bilinear form, an inner product on the space of homogeneous multivariate polynomials of a fixed deg...
Gert Vegter
DLT
2009
15 years 2 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Aleksi Saarela