NeilInCanadia's network_flow [15 articles] Export

Recent papers added to NeilInCanadia's library classified by the tag network_flow. You can also see everyone's network_flow.

Hide details

	A variational inequality formulation of the Dynamic Traffic Assignment Problem [My Copy] European Journal of Operational Research, Vol. 71, No. 2. (10 December 1993), pp. 188-204. by Omar Drissi-Kaitouni posted to network_flow traffic by NeilInCanadia on 2008-02-19 21:16:15 as
	Optimal Time-Varying Flows on Congested Networks [My Copy] Operations Research, Vol. 35, No. 1. (1987), pp. 58-69. by Malachy Carey posted to network_flow traffic by NeilInCanadia on 2008-02-18 23:00:26 as
	Time-Expanded Graphs for Flow-Dependent Transit Times [My Copy] Algorithms — ESA 2002 (2002), pp. 49-56. by Ekkehard Köhler, Katharina Langkau, Martin Skutella posted to network_flow traffic by NeilInCanadia on 2008-02-18 17:21:52 as
	Flows over Time: Towards a more Realistic and Computationally Tractable Model [My Copy] In ALENEX (2005) by Alexander Hall, Heiko Schilling posted to network_flow traffic by NeilInCanadia on 2008-02-01 19:37:53 as
	A survey of dynamic network flows [My Copy] Annals of Operations Research, Vol. 20, No. 1. (10 December 1989), pp. 1-66. by Jay Aronson posted to network_flow by NeilInCanadia on 2008-01-21 19:12:06 as
	Traffic Networks and Flows Over Time [My Copy] No. TR-752/2002. by Ekkehard Köhler, Rolf H. Möhring, Martin Skutella posted to network_flow by NeilInCanadia on 2008-01-21 18:02:52 as
	Constructing Maximal Dynamic Flows from Static Flows [My Copy] Operations Research, Vol. 6, No. 3. (1958), pp. 419-433. by L. R. Ford, D. R. Fulkerson posted to network_flow by NeilInCanadia on 2008-01-21 17:52:37 as
	Flows over time with load-dependent transit times [My Copy] In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (2002), pp. 174-183. by Ekkehard Köhler, Martin Skutella posted to network_flow by NeilInCanadia on 2008-01-21 17:28:17 as
	Network Flows: Theory, Algorithms, and Applications [My Copy] (18 February 1993) by Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin posted to books network_flow selfish_routing by NeilInCanadia on 2007-12-10 05:37:18 as along with 8 people and 1 group rocarvaj cradle25 AbnerCYH ahmadsuyuti nkorf gtdj meatball djlin Semantic-Social-Networks
	Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms [My Copy] Journal of the ACM, Vol. 46, No. 6. (November 1999), pp. 787-832. by Tom Leighton, Satish Rao posted to approximation network_flow by NeilInCanadia on 2007-11-16 16:18:46 as along with 3 people michael_hliao tmmurali mohits
	An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times [My Copy] Algorithmica, Vol. 47, No. 3. (April 2007), pp. 299-321. by Hall, Alex, Langkau, Katharina, Skutella, Martin posted to network_flow by NeilInCanadia on 2007-10-18 18:58:50 as
	A polynomial-time tree decomposition to minimize congestion [My Copy] In SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures (2003), pp. 34-43. by Chris Harrelson, Kirsten Hildrum, Satish Rao posted to network_flow routing by NeilInCanadia on 2007-10-16 21:26:30 as along with 1 person timos
	A polynomial time approximation scheme for the SONET ring loading problem [My Copy] Bell Labs Technical Journal, Vol. 2, No. 2. (1997), pp. 36-41. by Sanjeev Khanna posted to load_balancing network_flow routing by NeilInCanadia on 2007-10-11 15:10:41 as
	The Ring Loading Problem [My Copy] SIAM Journal on Discrete Mathematics, Vol. 11, No. 1. (1998), pp. 1-14. by Alexander Schrijver, Paul Seymour, Peter Winkler posted to load_balancing network_flow open_problems by NeilInCanadia on 2007-10-01 01:55:29 as
	Hardness of the undirected congestion minimization problem [My Copy] In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005), pp. 284-293. by Matthew Andrews, Lisa Zhang posted to hardness network_flow by NeilInCanadia on 2007-03-02 17:20:32 as

Note: You may cite this page as: http://www.citeulike.org/user/NeilInCanadia/tag/network_flow

CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

selfish_routing	38
approximation	28
network_design	26
survey	18
comp_geometry	17
oblivious	17
books	15
graph_theory	15
network_flow	15
vpn	15
random_walks	13
traffic	13
metric_embeddings	11
frog_model	10
networks	10
algorithms	9
complexity	9
hardness	9
load_balancing	9
probability	9
combinatorics	7
routing	7
branching_processes	6
matching	6
matroids	6
optimization	6
partitions	6
buy-at-bulk	5
ip	5
network_coding	5
network_games	5
nonatomic_games	5
notes	5
open_problems	5
probabilistic	5
random_graphs	5
source_location	5
tcp	5
chordal_graphs	4
concentration	4
confluent_flow	4
facility_location	4
graph_packing	4
monotone_paths	4
online_algorithms	4
robustness	4
terrain_guarding	4
agt	3
asymptotics	3
interesting	3
lp	3
planar_graphs	3
steiner	3
congestion_games	2
inequalities	2
matrix_multiplication	2
mcmc	2
metrics	2
percolation	2
rendezvous	2
rent_or_buy	2
scale_free	2
set_cover	2
spanning_trees	2
auctions	1
boolean_functions	1
brw	1
colouring	1
coordination	1
cops	1
cycle_packing	1
discrete_geometry	1
disjoint_paths	1
dynamic_flows	1
economics	1
edp	1
exact	1
expanders	1
functional_programming	1
geometry	1
graph_minors	1
hard-core	1
hypergraphs	1
incorrect	1
large_deviations	1
lie_groups	1
matrices	1
mfmc	1
mixing_time	1
mts	1
numerical_analysis	1
polyhedral	1
quantum_computing	1
reference	1
rounding	1
sle	1
spdes	1
statistical_physics	1
string_theory	1
thesis	1
type_theory	1
voronoi	1

NeilInCanadia's network_flow [15 articles] Export

NeilInCanadia's tags