1639 search results - page 143 / 328 » Degree-constrained network flows |
140
click to vote
DAM
2006
15 years 4 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
135
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— Admission control algorithms used in access networks for multiplexed voice sources are typically based on aggregated system characteristics, such as aggregate loss prob...
114
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
106
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— We consider a stochastic model of an ECN/RED gateway with competing TCP sources sharing the capacity. As the number of competing flows becomes large, the queue behavior at the...
129
click to vote
SIGMETRICS
2000
ACM
15 years 8 months ago
2000
ACM
Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flow...