1639 search results - page 261 / 328 » Degree-constrained network flows |
SODA
2001
ACM
14 years 16 days ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
BNT
1997
14 years 15 days ago
1997
Tag switching is a way to combine the label-swapping forwarding paradigm with network layer routing. This has several advantages. Tags can have a wide spectrum of forwarding granu...
OSDI
2000
ACM
14 years 15 days ago
2000
ACM
Many boundaries impede the flow of authorization information, forcing applications that span those boundaries into hop-by-hop approaches to authorization. We present a unified app...
AAAI
1996
14 years 14 days ago
1996
The Supply Chain Integrated Ordering Network (SCION) Depot Bookings system automates the planning and scheduling of perishable and non-perishable commodities and the vehicles that...
DIMVA
2009
14 years 7 days ago
2009
We demonstrate that the browser implementation used at a host can be passively identified with significant precision and recall, using only coarse summaries of web traffic to and f...