2398 search results - page 420 / 480 » Constraint Programming and Graph Algorithms |
SIGSOFT
2005
ACM
16 years 7 days ago
2005
ACM
A modular program analysis considers components independently and provides succinct summaries for each component, which can be used when checking the rest of the system. Consider ...
110
click to vote
SODA
2003
ACM
15 years 26 days ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
100
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
SOSP
2003
ACM
15 years 8 months ago
2003
ACM
This paper presents Capriccio, a scalable thread package for use with high-concurrency servers. While recent work has advocated event-based systems, we believe that threadbased sy...
91
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...