361 search results - page 26 / 73 » Maximum subset intersection |
112
click to vote
COMPGEOM
1994
ACM
15 years 6 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
116
click to vote
CCCG
2007
15 years 3 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
116
click to vote
ENDM
2008
15 years 2 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
JCT
2008
15 years 1 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
100
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...