The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase multiple additive constraints (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2000-2009 (9)
Publication types (Num. hits)
article(4) inproceedings(5)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 2 keywords

Results
Found 9 publication records. Showing 9 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ronghui Hou, King-Shan Lui, Ka-Cheong Leung, Fred Baker Approximation Algorithm for QoS Routing with Multiple Additive Constraints. Search on Bibsonomy ICC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Abdelfettah Belghith, Adel Ben Mnaouer, Naouel Ben Ali A taboo-based search algorithm to enhance multicast routing under multiple additive constraints. Search on Bibsonomy AICCSA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Naouel Ben Ali, Abdelfattah Belghith, Joanna Moulierac, Miklós Molnár QoS multicast aggregation under multiple additive constraints. Search on Bibsonomy Computer Communications The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan Thulasiraman Polynomial time approximation algorithms for multi-constrained QoS routing. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF efficient approximation algorithms, multiple additive constraints, quality-of-service (QoS) routing
1Guoliang Xue, Arunabha Sen, Weiyi Zhang, Jian Tang, Krishnaiyan Thulasiraman Finding a path subject to many additive QoS constraints. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF efficient approximation algorithms, multiple additive constraints, QoS routing
1Gang Cheng, Nirwan Ansari Finding a least hop(s) path subject to multiple additive constraints. Search on Bibsonomy Computer Communications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Piet Van Mieghem, Fernando A. Kuipers, Turgay Korkmaz, Marwan Krunz, Marília Curado, Edmundo Monteiro, Xavier Masip-Bruin, Josep Solé-Pareta, Sergio Sánchez-López Quality of Service Routing. Search on Bibsonomy QofIS Final Report The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Turgay Korkmaz, Marwan Krunz, Spyros Tragoudas An efficient algorithm for finding a path subject to two additive constraints. Search on Bibsonomy SIGMETRICS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF multiple constrained path selection, QoS routing, scalable routing
Displaying result #1 - #9 of 9 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.