default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 29 matches
- 1998
- Panos M. Pardalos, Ding-Zhu Du:
Network Design: Connectivity and Facilities Location, Proceedings of a DIMACS Workshop, Princetin, New Jersey, USA, April 28-30, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 40, DIMACS/AMS 1998, ISBN 978-0-8218-0834-4 [contents] - 1997
- Claire S. Adjiman, Carl A. Schweiger, Christodoulos A. Floudas:
Nonlinear and mixed-integer optimization in chemical process network systems. Network Design: Connectivity and Facilities Location 1997: 429-452 - Sanjeev Arora:
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. Network Design: Connectivity and Facilities Location 1997: 1-2 - Roberto Battiti, Alan A. Bertossi:
Differential greedy for the 0-1 equicut problem. Network Design: Connectivity and Facilities Location 1997: 3-21 - Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald:
Shortest networks on spheres. Network Design: Connectivity and Facilities Location 1997: 453-461 - Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
Gradient-constrained minimal Steiner trees. Network Design: Connectivity and Facilities Location 1997: 23-38 - Sui-Wing Cheng:
The Steiner tree problem for terminals on the boundary of a rectilinear polygon. Network Design: Connectivity and Facilities Location 1997: 39-57 - Dietmar Cieslik:
Using Hadwiger numbers in network design. Network Design: Connectivity and Facilities Location 1997: 59-77 - Narsingh Deo, Nishit Kumar:
Constrained spanning tree problems: Approximate methods and parallel computation. Network Design: Connectivity and Facilities Location 1997: 191-217 - Cees Duin:
Reducing the graphical Steiner problem with a sensitivity test. Network Design: Connectivity and Facilities Location 1997: 79-107 - Andreas Eisenblätter:
A frequency assignment problem in cellular phone networks. Network Design: Connectivity and Facilities Location 1997: 109-115 - Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
An optimal greedy algorithm for wavelength allocation in directed tree networks. Network Design: Connectivity and Facilities Location 1997: 117-129 - Sudipto Guha, Samir Khuller:
Connected facility location problems. Network Design: Connectivity and Facilities Location 1997: 179-190 - Kristina Holmqvist, Athanasios Migdalas, Panos M. Pardalos:
A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem. Network Design: Connectivity and Facilities Location 1997: 131-142 - Klaus Jansen:
Approximation results for the optimum cost chromatic partition problem. Network Design: Connectivity and Facilities Location 1997: 143-168 - Marek Karpinski, Alexander Zelikovsky:
Approximating dense cases of covering problems. Network Design: Connectivity and Facilities Location 1997: 169-178 - Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi:
Network improvement problems. Network Design: Connectivity and Facilities Location 1997: 247-268 - Wu-Ji Li, James MacGregor Smith:
Star, grid, ring topologies in facility location & network design. Network Design: Connectivity and Facilities Location 1997: 219-246 - Madhav V. Marathe, R. Ravi, Ravi Sundaram:
Improved results on service-constrained network design problems. Network Design: Connectivity and Facilities Location 1997: 269-276 - Robert A. Murphey, Panos M. Pardalos, Leonidas S. Pitsoulis:
A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. Network Design: Connectivity and Facilities Location 1997: 277-301 - Warren B. Powell, Zhi-Long Chen:
A generalized threshold algorithm for the shortest path problem with time windows. Network Design: Connectivity and Facilities Location 1997: 303-318 - José D. P. Rolim, Luca Trevisan:
A case study of de-randomization methods for combinatorial approximation algorithms. Network Design: Connectivity and Facilities Location 1997: 319-334 - Stefan Voß, Kai Gutenschwager:
A chunking based genetic algorithm for the Steiner tree problem in graphs. Network Design: Connectivity and Facilities Location 1997: 335-355 - Peng-Jun Wan, Allalaghatta Pavan:
A scalable TWDM lightwave network based on generalized de Bruijn digraph. Network Design: Connectivity and Facilities Location 1997: 397-414 - David M. Warme:
A new exact algorithm for rectilinear Steiner trees. Network Design: Connectivity and Facilities Location 1997: 357-395 - J. F. Weng:
A new model of generalized Steiner trees and 3-coordinate systems. Network Design: Connectivity and Facilities Location 1997: 415-424 - Roland Wessäly:
A model for network design. Network Design: Connectivity and Facilities Location 1997: 425-428 - Foreword. Network Design: Connectivity and Facilities Location 1997: xi-
- Preface. Network Design: Connectivity and Facilities Location 1997: xiii-
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-30 05:48 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint