Sciweavers

973 search results - page 44 / 195
» New Bounds on Crossing Numbers
Sort
View
JSC
2010
85views more  JSC 2010»
14 years 10 months ago
On the minimum of a positive polynomial over the standard simplex
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk , assuming that P is p...
Gabriela Jeronimo, Daniel Perrucci
CPAIOR
2005
Springer
15 years 5 months ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...
MST
2002
152views more  MST 2002»
14 years 11 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
FSTTCS
2009
Springer
15 years 4 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
APVIS
2007
15 years 1 months ago
Straight-line grid drawings of planar graphs with linear area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
Md. Rezaul Karim, Md. Saidur Rahman