168 search results - page 16 / 34 » New upper bounds on the decomposability of planar graphs |
TRANSCI
2010
13 years 5 months ago
2010
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
PODS
2006
ACM
14 years 6 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
JCT
2007
13 years 6 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
SOFSEM
2007
Springer
14 years 25 days ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...