224 search results - page 16 / 45 » G-graphs for the cage problem: a new upper bound |
164
click to vote
ORDER
2007
15 years 5 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
154
click to vote
AIPS
2004
15 years 7 months ago
2004
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
168
click to vote
APVIS
2008
15 years 7 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
142
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
147
click to vote
CN
2006
15 years 6 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...