|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1303 occurrences of 739 keywords
|
|
|
|
|
Results
Found 1744 publication records. Showing 1744 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 5 | Baruch Awerbuch, Yossi Azar |
Buy-at-Bulk Network Design.  |
FOCS  |
1997 |
DBLP DOI BibTeX RDF |
buy-at-bulk network design, central network switch, multi-sink network design, selective network design, Generalized Steiner Connectivity, Prize-collecting salesman, K-MST, connectivity, network routing, network capacity |
| 4 | Cüneyt F. Bazlamaçci, Fatih Say |
Minimum concave cost multicommodity network design.  |
Telecommunication Systems  |
2007 |
DBLP DOI BibTeX RDF |
Concave cost network design, Circuit switching and packet switching network design, Multicommodity flow problem |
| 4 | Tommy Thomadsen, Thomas Stidsen |
Hierarchical Ring Network Design Using Branch-and-Price.  |
Telecommunication Systems  |
2005 |
DBLP DOI BibTeX RDF |
ring network design, hierarchical network design, branch-and-price |
| 3 | Xujin Chen, Bo Chen |
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Soft capacity, Approximation algorithm, Network design, Facility location, Performance guarantee |
| 3 | Xianjin Zhu, Rik Sarkar, Jie Gao |
Segmenting a sensor field: Algorithms and applications in network design.  |
TOSN  |
2009 |
DBLP DOI BibTeX RDF |
flow complex, topology-adaptive protocols, sensor networks, network design, Shape segmentation |
| 3 | Ho-Lin Chen, Tim Roughgarden |
Network Design with Weighted Players.  |
Theory Comput. Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Network design, Algorithmic game theory, Price of stability |
| 3 | Wassim El-Hajj, Hazem M. Hajj, Zouheir Trabelsi |
On fault tolerant ad hoc network design.  |
IWCMC  |
2009 |
DBLP DOI BibTeX RDF |
network design and planning, fault tolerance, ad hoc networks |
| 3 | Loukas Dimitriou, Antony Stathopoulos |
Optimal Co-evolutionary Strategies for the Competitive Maritime Network Design Problem.  |
EvoWorkshops  |
2009 |
DBLP DOI BibTeX RDF |
Freight Networks, Maritime Container Terminal Systems, Competitive Network Design, Co-Evolutionary non-Cooperative Algorithms |
| 3 | Guy Kortsarz, Zeev Nutov |
Approximating Some Network Design Problems with Node Costs.  |
APPROX-RANDOM  |
2009 |
DBLP DOI BibTeX RDF |
Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation |
| 3 | Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi |
Online and stochastic survivable network design.  |
STOC  |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, online algorithms, network design problems |
| 3 | Michael Laszlo, Sumitra Mukherjee |
An approximation algorithm for network design problems with downwards-monotone demand functions.  |
Optimization Letters  |
2008 |
DBLP DOI BibTeX RDF |
Spanning forests, Approximation algorithms, Integer programs, Network design problems |
| 3 | Elliot Anshelevich, Lisa Zhang |
Path decomposition under a new cost measure with applications to optical network design.  |
ACM Transactions on Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
Optical network design, path decomposition, approximation algorithms |
| 3 | Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha |
On the approximability of some network design problems.  |
ACM Transactions on Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
cost-distance, fixed charge network flow, priority Steiner tree, network design, Hardness of approximation |
| 3 | Gustavo Olague, Enrique Dunn, Evelyne Lutton |
Individual Evolution as an Adaptive Strategy for Photogrammetric Network Design.  |
Adaptive and Multilevel Metaheuristics  |
2008 |
DBLP DOI BibTeX RDF |
Individual Evolution, Photogrammetric Network Design, Coevolution |
| 3 | John S. Baras |
Multi-hop mobile wireless network design: implicit cross-layer loss models and performance sensitivities.  |
MOBICOM  |
2008 |
DBLP DOI BibTeX RDF |
loss models, performance sensitivity computation, wireless network design |
| 3 | Baruch Awerbuch, Rohit Khandekar |
Cost sharing mechanisms for near-optimal traffic aggregation and network design.  |
SPAA  |
2008 |
DBLP DOI BibTeX RDF |
cost sharing mechanism, traffic aggregation, network design |
| 3 | Naruemon Wattanapongsakorn, Chalermpol Charnsripinyo, Pakorn Leesutthipornchai |
Providing Fault Tolerance in Wireless Backhaul Network Design with Path Restoration.  |
ARES  |
2008 |
DBLP DOI BibTeX RDF |
Network Path Restoration, Genetic Algorithm, Optimization Algorithm, Survivable Network Design |
| 3 | Lap Chi Lau, Mohit Singh |
Additive approximation for bounded degree survivable network design.  |
STOC  |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, steiner tree, bounded degree, iterative rounding, survivable network design |
| 3 | Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan |
Additive guarantees for degree bounded directed network design.  |
STOC  |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, directed graphs, network design |
| 3 | Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna |
Network design for vertex connectivity.  |
STOC  |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, hardness of approximation, vertex connectivity |
| 3 | Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden |
Approximation via cost sharing: Simpler and better approximation algorithms for network design.  |
J. ACM  |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithms, network design, random sampling, cost sharing |
| 3 | Loukas Dimitriou, Theodore Tsekeris, Antony Stathopoulos |
Evolutionary Combinatorial Programming for Discrete Road Network Design with Reliability Requirements.  |
EvoWorkshops  |
2007 |
DBLP DOI BibTeX RDF |
Stochastic Discrete Network Design, Mathematical Simulation, Genetic Algorithms, Game Theory, Network Reliability |
| 3 | Baruch Awerbuch, Rohit Khandekar |
On cost sharing mechanisms in the network design game.  |
PODC  |
2007 |
DBLP DOI BibTeX RDF |
network design, cost sharing |
| 3 | Jean-François Cordeau, Federico Pasin, Marius M. Solomon |
An integrated model for logistics network design.  |
Annals OR  |
2006 |
DBLP DOI BibTeX RDF |
Network design, Logistics, Benders decomposition |
| 3 | Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni |
Secure Overlay Network Design.  |
AAIM  |
2006 |
DBLP DOI BibTeX RDF |
optimization, network security, network design, combinatorics |
| 3 | Hasan Selim, Irem Ozkarahan |
Application of Fuzzy Multi-objective Programming Approach to Supply Chain Distribution Network Design Problem.  |
MICAI  |
2006 |
DBLP DOI BibTeX RDF |
Fuzzy multi-objective programming, Distribution network design, Supply Chain |
| 3 | Ho-Lin Chen, Tim Roughgarden |
Network design with weighted players.  |
SPAA  |
2006 |
DBLP DOI BibTeX RDF |
network design, network games, nash equilibria, price of stability |
| 3 | Raja Jothi, Balaji Raghavachari |
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design.  |
ACM Transactions on Algorithms  |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, Spanning trees, minimum spanning trees |
| 3 | Ada M. Alvarez, José Luis González Velarde, Karim De-Alba |
Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem.  |
J. Heuristics  |
2005 |
DBLP DOI BibTeX RDF |
Scater Search, network design, GRASP |
| 3 | Eric Rosenberg |
Hierarchical topological network design.  |
IEEE/ACM Trans. Netw.  |
2005 |
DBLP DOI BibTeX RDF |
dynamic programming, network design, survivability, hierarchical design |
| 3 | Ada M. Alvarez, José Luis González Velarde, Karim De-Alba |
Scatter Search for Network Design Problem.  |
Annals OR  |
2005 |
DBLP DOI BibTeX RDF |
network design, metaheuristics, GRASP, scatter search |
| 3 | Moses Charikar, Adriana Karagiozova |
On non-uniform multicommodity buy-at-bulk network design.  |
STOC  |
2005 |
DBLP DOI BibTeX RDF |
buy-at-bulk, multicommodity, approximation algorithms, network design, non-uniform |
| 3 | Lorenzo Brunetta, Federico Malucelli, Peter Värbrand, Di Yuan |
Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming.  |
Telecommunication Systems  |
2004 |
DBLP DOI BibTeX RDF |
OXC placement, integer programming, network design, WDM |
| 3 | Massimo Franceschetti, Matthew Cook, Jehoshua Bruck |
A Geometric Theorem for Network Design.  |
IEEE Trans. Computers  |
2004 |
DBLP DOI BibTeX RDF |
wireless networks, network design, Facility location, combinatorial geometry |
| 3 | Teodor Gabriel Crainic, Bernard Gendron, Geneviève Hernu |
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design.  |
J. Heuristics  |
2004 |
DBLP DOI BibTeX RDF |
slope scaling, Lagrangean heuristic, multicommodity capacitated fixed-charge network design, long-term memory |
| 3 | Alain Chabrier, Emilie Danna, Claude Le Pape, Laurent Perron |
Solving a Network Design Problem.  |
Annals OR  |
2004 |
DBLP DOI BibTeX RDF |
industrial benchmark, network design, constraint programming, mixed integer programming, branch and price |
| 3 | Ilfat Ghamlouche, Teodor Gabriel Crainic, Michel Gendreau |
Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design.  |
Annals OR  |
2004 |
DBLP DOI BibTeX RDF |
fixed-charge capacitated multicommodity network design, cycle-based neighbourhoods, tabu search, meta-heuristics, path relinking |
| 3 | Gilbert Laporte, Ángel Marín, Juan A. Mesa, Francisco A. Ortega |
An Integrated Methodology for the Rapid Transit Network Design Problem.  |
ATMOS  |
2004 |
DBLP DOI BibTeX RDF |
Rapid Transit Systems, Network Design |
| 3 | E. Alba |
Evolutionary Algorithms for Optimal Placement of Antennae in Radio Network Design.  |
IPDPS  |
2004 |
DBLP DOI BibTeX RDF |
radio network design, performance evaluation, parallel evolutionary algorithm |
| 3 | Nadia Cobos Zaleta, Ada Margarita Alvarez Socarrás |
Tabu Search-based algorithm for Capacitated Multicommodity Network Design Problem.  |
CONIELECOMP  |
2004 |
DBLP DOI BibTeX RDF |
multicommodity networks, Tabu Search, network design |
| 3 | Refael Hassin, R. Ravi, F. Sibel Salman |
Approximation Algorithms for a Capacitated Network Design Problem.  |
Algorithmica  |
2003 |
DBLP DOI BibTeX RDF |
Routing flow, Capacity installation, Approximation algorithms, Network design |
| 3 | Filipe F. Mazzini, Geraldo Robson Mateus, James MacGregor Smith |
Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems.  |
Wireless Networks  |
2003 |
DBLP DOI BibTeX RDF |
cellular network design, frequency channel assignment, base station location, optimization, algorithms |
| 3 | Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler |
Near-optimal network design with selfish agents.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
network design, price of anarchy |
| 3 | Anupam Gupta, Amit Kumar, Tim Roughgarden |
Simpler and better approximation algorithms for network design.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
approximation algorithms, randomized algorithms, network design |
| 3 | Ricardo García, Ángel Marín |
Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem.  |
Annals OR  |
2002 |
DBLP DOI BibTeX RDF |
parking capacity and fares in park'n ride trips, bilevel mathematical programming, multicommodity network equilibrium model with combined modes, simulated annealing, network design problem |
| 3 | Ronald H. Ballou |
Unresolved Issues in Supply Chain Network Design.  |
Information Systems Frontiers  |
2001 |
DBLP DOI BibTeX RDF |
logistics network configuration, supply chain management, network design, facility location |
| 3 | C. D. Randazzo, Henrique Pacca Loureiro Luna |
A Comparison of Optimal Methods for Local Access Uncapacitated Network Design.  |
Annals OR  |
2001 |
DBLP DOI BibTeX RDF |
branch-and-bound, network design, branch-and-cut, Benders decomposition |
| 3 | S. Trilochan Sastry |
One and Two Facility Network Design Revisited.  |
Annals OR  |
2001 |
DBLP DOI BibTeX RDF |
integer solutions, quasi-integral, network design, exact algorithm |
| 3 | Geraldo Robson Mateus, Antonio Alfredo Ferreira Loureiro, Ricardo C. Rodrigues |
Optimal Network Design for Wireless Local Area Network.  |
Annals OR  |
2001 |
DBLP DOI BibTeX RDF |
WLAN, network design, capacity planning, optimization models |
| 3 | Luis Gouveia, João Telhada |
An Augmented Arborescence Formulation for the Two-Level Network Design Problem.  |
Annals OR  |
2001 |
DBLP DOI BibTeX RDF |
spanning trees and steiner trees, multicommodity flow models, network design, linear programming relaxations |
| 3 | Sudipto Guha, Adam Meyerson, Kamesh Munagala |
Hierarchical Placement and Network Design Problems.  |
FOCS  |
2000 |
DBLP DOI BibTeX RDF |
subscriber loops, hierarchical placement, layered network design problems, constant approximations, bounded miss rates, minimum total cost, routing demand, layered caching scenarios, combinatorial approximation, multi-level facility location problem, load-balanced facility location problem, open facilities, access network design problem, resource allocation, facility location, cache storage, file organisation, approximation theory, hierarchical systems, network synthesis, hierarchical caching |
| 3 | Melanie Hilario, Ahmed Rida, Christian Pellegrini |
A Metalevel Architecture for Knowledge-Based Neural Network Design. (PDF / PS)  |
ICTAI  |
1997 |
DBLP DOI BibTeX RDF |
Neurosymbolic integration, Knowledge-based neural network design, Neural networks, Hybrid systems |
| 3 | Shie-Jue Lee, Chih-Hung Wu |
A knowledge-based approach to the local area network design problem.  |
Appl. Intell.  |
1994 |
DBLP DOI BibTeX RDF |
Local area network design, expert systems, knowledge base, blackboard |
| 2 | Masayuki Minoura, Norihiko Shinomiya, Kazuyuki Tajima, Takuya Miyashita, Motoyoshi Sekiya |
An Evaluation Technique Using Network Voronoi Diagram for Balanced Optical Network Design.  |
AINA Workshops  |
2010 |
DBLP DOI BibTeX RDF |
Network Voronoi diagram, distribution balance, network design |
| 2 | Volkan Cevher, Lance M. Kaplan |
Acoustic sensor network design for position estimation.  |
TOSN  |
2009 |
DBLP DOI BibTeX RDF |
Bayesian experimental design, sensor networks, dynamic programming |
| 2 | Takuro Fukunaga, Hiroshi Nagamochi |
Network Design with Edge-Connectivity and Degree Constraints.  |
Theory Comput. Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Degree constraint, (m,n)-VRP, Approximation algorithm, TSP, Vehicle routing problem, Edge-connectivity |
| 2 | Fernando Gordejuela-Sanchez, Alpár Jüttner, Jie Zhang |
A multiobjective optimization framework for IEEE 802.16e network design and performance analysis.  |
IEEE Journal on Selected Areas in Communications  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Ángel Marín, Juan A. Mesa, Federico Perea |
Integrating Robust Railway Network Design and Line Planning under Failures.  |
Robust and Online Large-Scale Optimization  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Navin Goyal, Neil Olver, F. Bruce Shepherd |
Dynamic vs. Oblivious Routing in Network Design.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Takuro Fukunaga, Hiroshi Nagamochi |
Network Design with Weighted Degree Constraints.  |
WALCOM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski |
Approximation Algorithms for Buy-at-Bulk Geometric Network Design.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Abdullah Konak, Sadan Kulturel-Konak |
An Integrated Genetic Algorithm and Integer Programming Approach to the Network Design Problem with Relays.  |
CPAIOR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi |
Approximation Algorithms for a Network Design Problem.  |
COCOON  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Julia Chuzhoy, Sanjeev Khanna |
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
vertex-connectivity, survivable network design |
| 2 | Mohamed Zied Ben Hamouda, Olivier Brun, Jean-Marie Garcia |
A Tabu Search heuristic for capacitated network design.  |
ISCC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Tzong-Heng Chi, Chia-Chien Lin, Wei-Chen Lin |
Intraorganizational power verified interactive genetic algorithms for the design of logistics network.  |
Int. Conf. Interaction Sciences  |
2009 |
DBLP DOI BibTeX RDF |
logistics network design, power, interactive genetic algorithm |
| 2 | Martin Hoefer |
Non-Cooperative Tree Creation.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Approximate Nash equilibrium, Connection game, Network design, Steiner tree, Price of anarchy |
| 2 | Peter Broström, Kaj Holmberg |
Design of OSPF networks using subpath consistent routing patterns.  |
Telecommunication Systems  |
2009 |
DBLP DOI BibTeX RDF |
Subpath consistency, Internet protocol, Network design, OSPF, Lagrangean relaxation |
| 2 | Anupam Gupta, Aravind Srinivasan, Éva Tardos |
Cost-Sharing Mechanisms for Network Design.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Ángel Marín, Esteve Codina |
Network design: taxi planning.  |
Annals OR  |
2008 |
DBLP DOI BibTeX RDF |
Aircraft routing and scheduling, Taxi planning, Airport management, Binary capacitated multicommodity flow network, Branch and Bound |
| 2 | Isao Yagyu, Hiroshi Hasegawa, Ken-ichi Sato |
An efficient hierarchical optical path network design algorithm based on a traffic demand expression in a cartesian product space.  |
IEEE Journal on Selected Areas in Communications  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Koichi Kanie, Hiroshi Hasegawa, Ken-ichi Sato |
Quasi-Dynamic Network Design Considering Different Service Holding Times.  |
IEEE Journal on Selected Areas in Communications  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama |
A Network Design Problem by a GA with Linkage Identification and Recombination for Overlapping Building Blocks.  |
Linkage in Evolutionary Computation  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Anke van Zuylen |
Deterministic Sampling Algorithms for Network Design.  |
ESA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Susanne Albers |
On the value of coordination in network design.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Loukas Dimitriou, Theodore Tsekeris, Antony Stathopoulos |
Genetic Computation of Road Network Design and Pricing Stackelberg Games with Multi-class Users.  |
EvoWorkshops  |
2008 |
DBLP DOI BibTeX RDF |
Road Pricing, Equilibrium Network Design, Regulated Private Highways, Genetic Algorithms, Stackelberg Games |
| 2 | Kalika Suksomboon, Piyanan Satayapiwat, Chaodit Aswakul |
Software development for automated network design supporting unicast and multicast traffics in next generation network.  |
SimuTools  |
2008 |
DBLP DOI BibTeX RDF |
NGN software, GUI, network design, network performance |
| 2 | Yago Sáez, Fernando Zazo, Pedro Isasi |
A Study of the Effects of Clustering and Local Search on Radio Network Design: Evolutionary Computation Approaches.  |
HIS  |
2008 |
DBLP DOI BibTeX RDF |
Radio Network Design, OPLINK, chromosome appearance probabilty matrix, genetic algorithm, Evolutionary Computation, memetic algorithm |
| 2 | V. Teterin, Steve Hurley, Stuart M. Allen |
Unified WiMAX network design with service optimization.  |
Mobility Conference  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Hamza Drid, Bernard Cousin, Samer Lahoud, Miklós Molnár |
Multi-criteria p-cycle network design.  |
LCN  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Jude Akpuh, John Doucette |
Sizing Eligible Route Sets for Restorable Network Design and Optimization.  |
ICC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | X. W. Qin, F. Qin |
Hybrid Particle Swarm Optimization Algorithm for the Logistics Network Design Problem under Concave Cost Function.  |
CSSE  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Joseph Chabarek, Joel Sommers, Paul Barford, Cristian Estan, David Tsiang, Stephen Wright |
Power Awareness in Network Design and Routing.  |
INFOCOM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Hoda Hassan, Ramy Eltarras, Mohamed Eltoweissy |
Towards a Framework for Evolvable Network Design.  |
CollaborateCom  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Chandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson |
Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements.  |
WAOA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Michal Pióro, Tomasz Sliwinski, Michal Zagozdzon, Mateusz Dzida, Wlodzimierz Ogryczak |
Path Generation Issues for Survivable Network Design.  |
ICCSA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung |
Degree Bounded Network Design with Metric Costs.  |
FOCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Navin Goyal, Neil Olver, F. Bruce Shepherd |
The vpn conjecture is true.  |
STOC  |
2008 |
DBLP DOI BibTeX RDF |
network design, robust optimization, oblivious routing |
| 2 | Jens Maßberg, Jens Vygen |
Approximation algorithms for a facility location problem with service capacities.  |
ACM Transactions on Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithm, network design, VLSI design, facility location |
| 2 | Markus Leitner, Günther R. Raidl |
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem.  |
SAINT  |
2008 |
DBLP DOI BibTeX RDF |
Network Design, Integer Linear Programming, Variable Neighborhood Search, Connected Facility Location |
| 2 | Timo Ojala, Toni Hakanen, Ossi Salmi, Mikko Kenttälä, Juha Tiensyrjä |
Supporting Session and Access Point Mobility in a Large Multi-provider Multi-vendor Municipal WiFi Network.  |
AccessNets  |
2008 |
DBLP DOI BibTeX RDF |
mobility, wireless, network design, handover, roaming, municipal |
| 2 | Markus Leitner, Günther R. Raidl |
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks.  |
Hybrid Metaheuristics  |
2008 |
DBLP DOI BibTeX RDF |
Redundancy, Network Design, Lagrangian Relaxation, Variable Neighborhood Search, Steiner Tree Problem, Greedy Randomized Adaptive Search Procedure, Survivable Network Design |
| 2 | Chandra Chekuri |
Routing and network design with robustness to changing or uncertain traffic demands.  |
SIGACT News  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximation algorithms for node-weighted buy-at-bulk network design.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Miguel A. Vega-Rodríguez, David Vega-Pérez, Juan Antonio Gómez Pulido, Juan Manuel Sánchez-Pérez |
Radio Network Design Using Population-Based Incremental Learning and Grid Computing with BOINC.  |
EvoWorkshops  |
2007 |
DBLP DOI BibTeX RDF |
RND, PBIL, BOINC, Grid Computing, Evolutionary Algorithm, Coverage, Antenna |
| 2 | Haiyang Hou, Guochuan Zhang |
The Hardness of Selective Network Design for Bottleneck Routing Games.  |
TAMC  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Jaana Laiho, Achim Wacker, Susanne Müller |
Measurement based methods for WCDMA radio network design verification.  |
SpringSim  |
2007 |
DBLP DOI BibTeX RDF |
field measurement tool, network life cycle, protocol analyzer, mobile agent, network management system |
| 2 | Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama |
A network design problem by a GA with linkage identification and recombination for overlapping building blocks.  |
IEEE Congress on Evolutionary Computation  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Jin-Myung Won, Fakhreddine Karray |
A Genetic Algorithm with cycle representation and contraction digraph model for Guideway Network design of Personal Rapid Transit.  |
IEEE Congress on Evolutionary Computation  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Sotiris E. Nikoletseas, Paul G. Spirakis |
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects.  |
ALGOSENSORS  |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 1744 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|