Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(steiner problem). Showing records 1 – 19 of 19 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Universiteit Utrecht

1. Graaff, L.W. van der. Dynamic programming on Nice Tree Decompositions.

Degree: 2015, Universiteit Utrecht

 Connectivity problems such as the Steiner Tree Problem are NP-hard problems that are fixed parameter tractable in the treewidth of the input graph. In this… (more)

Subjects/Keywords: treewidth; Steiner tree problem; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Graaff, L. W. v. d. (2015). Dynamic programming on Nice Tree Decompositions. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/309652

Chicago Manual of Style (16th Edition):

Graaff, L W van der. “Dynamic programming on Nice Tree Decompositions.” 2015. Masters Thesis, Universiteit Utrecht. Accessed October 25, 2020. http://dspace.library.uu.nl:8080/handle/1874/309652.

MLA Handbook (7th Edition):

Graaff, L W van der. “Dynamic programming on Nice Tree Decompositions.” 2015. Web. 25 Oct 2020.

Vancouver:

Graaff LWvd. Dynamic programming on Nice Tree Decompositions. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Oct 25]. Available from: http://dspace.library.uu.nl:8080/handle/1874/309652.

Council of Science Editors:

Graaff LWvd. Dynamic programming on Nice Tree Decompositions. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/309652

2. Matsubara, Camila Mari. Algoritmos para o problema da árvore de Steiner com coleta de prêmios.

Degree: Mestrado, Ciência da Computação, 2012, University of São Paulo

Neste projeto estudamos algoritmos de aproximação para o problema da árvore de Steiner com coleta de prêmios. Trata-se de uma generalização do problema da árvore… (more)

Subjects/Keywords: algoritmo de aproximação; approximation algorithm; árvore de Steiner; prize-collecting problem; problema com coleta de prêmios; Steiner tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Matsubara, C. M. (2012). Algoritmos para o problema da árvore de Steiner com coleta de prêmios. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-18082014-170526/ ;

Chicago Manual of Style (16th Edition):

Matsubara, Camila Mari. “Algoritmos para o problema da árvore de Steiner com coleta de prêmios.” 2012. Masters Thesis, University of São Paulo. Accessed October 25, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-18082014-170526/ ;.

MLA Handbook (7th Edition):

Matsubara, Camila Mari. “Algoritmos para o problema da árvore de Steiner com coleta de prêmios.” 2012. Web. 25 Oct 2020.

Vancouver:

Matsubara CM. Algoritmos para o problema da árvore de Steiner com coleta de prêmios. [Internet] [Masters thesis]. University of São Paulo; 2012. [cited 2020 Oct 25]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-18082014-170526/ ;.

Council of Science Editors:

Matsubara CM. Algoritmos para o problema da árvore de Steiner com coleta de prêmios. [Masters Thesis]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-18082014-170526/ ;

3. Zey, Bernd. Solving two-stage stochastic network design problems to optimality.

Degree: 2017, Technische Universität Dortmund

 The Steiner tree problem (STP) is a central and well-studied graph-theoretical combinatorial optimization problem which plays an important role in various applications. It can be… (more)

Subjects/Keywords: Two-stage stochastic network design; Stochastic Steiner tree; Integer linear programming; Fixed parameter tractable; 004; Steiner-Baum; Ganzzahlige lineare Optimierung; Steiner-Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zey, B. (2017). Solving two-stage stochastic network design problems to optimality. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-18290

Chicago Manual of Style (16th Edition):

Zey, Bernd. “Solving two-stage stochastic network design problems to optimality.” 2017. Doctoral Dissertation, Technische Universität Dortmund. Accessed October 25, 2020. http://dx.doi.org/10.17877/DE290R-18290.

MLA Handbook (7th Edition):

Zey, Bernd. “Solving two-stage stochastic network design problems to optimality.” 2017. Web. 25 Oct 2020.

Vancouver:

Zey B. Solving two-stage stochastic network design problems to optimality. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2017. [cited 2020 Oct 25]. Available from: http://dx.doi.org/10.17877/DE290R-18290.

Council of Science Editors:

Zey B. Solving two-stage stochastic network design problems to optimality. [Doctoral Dissertation]. Technische Universität Dortmund; 2017. Available from: http://dx.doi.org/10.17877/DE290R-18290


Université Catholique de Louvain

4. Filipecki, Bartosz. Strengthened formulations for MIP problems in networks.

Degree: 2018, Université Catholique de Louvain

Many real-world problems can be formulated in the framework of mixedinteger programming. This includes many problems in routing, scheduling and other fields, which affect our… (more)

Subjects/Keywords: Mixed-Integer Programming; Extended Formulations; Valid Inequalities; Optimal Power Flow; Steiner Tree Problem; Convex Rexoloring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Filipecki, B. (2018). Strengthened formulations for MIP problems in networks. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/195710

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Filipecki, Bartosz. “Strengthened formulations for MIP problems in networks.” 2018. Thesis, Université Catholique de Louvain. Accessed October 25, 2020. http://hdl.handle.net/2078.1/195710.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Filipecki, Bartosz. “Strengthened formulations for MIP problems in networks.” 2018. Web. 25 Oct 2020.

Vancouver:

Filipecki B. Strengthened formulations for MIP problems in networks. [Internet] [Thesis]. Université Catholique de Louvain; 2018. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/2078.1/195710.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Filipecki B. Strengthened formulations for MIP problems in networks. [Thesis]. Université Catholique de Louvain; 2018. Available from: http://hdl.handle.net/2078.1/195710

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Victoria University of Wellington

5. Grimwood, Geoffrey Ross. The Euclidean Steiner Tree Problem: Simulated Annealing and Other Heuristics.

Degree: 1994, Victoria University of Wellington

 In this thesis the Euclidean Steiner tree problem and the optimisation technique called simulated annealing are studied. In particular, there is an investigation of whether… (more)

Subjects/Keywords: Simulated annealing; Euclidean Steiner tree problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Grimwood, G. R. (1994). The Euclidean Steiner Tree Problem: Simulated Annealing and Other Heuristics. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1374

Chicago Manual of Style (16th Edition):

Grimwood, Geoffrey Ross. “The Euclidean Steiner Tree Problem: Simulated Annealing and Other Heuristics.” 1994. Masters Thesis, Victoria University of Wellington. Accessed October 25, 2020. http://hdl.handle.net/10063/1374.

MLA Handbook (7th Edition):

Grimwood, Geoffrey Ross. “The Euclidean Steiner Tree Problem: Simulated Annealing and Other Heuristics.” 1994. Web. 25 Oct 2020.

Vancouver:

Grimwood GR. The Euclidean Steiner Tree Problem: Simulated Annealing and Other Heuristics. [Internet] [Masters thesis]. Victoria University of Wellington; 1994. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/10063/1374.

Council of Science Editors:

Grimwood GR. The Euclidean Steiner Tree Problem: Simulated Annealing and Other Heuristics. [Masters Thesis]. Victoria University of Wellington; 1994. Available from: http://hdl.handle.net/10063/1374


University of Melbourne

6. Whittle, David. Underground mine plan optimisation.

Degree: 2019, University of Melbourne

 This thesis addresses several topics relating to the planning of underground mines, with a focus on underlying mathematical models. Some mineral resources are mined by… (more)

Subjects/Keywords: transition problem; OR in natural resources; graph theory; strongly connected components; underground mine plan optimization; maximum graph closure; prize collecting Euclidean Steiner tree; prize collecting Steiner tree in graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Whittle, D. (2019). Underground mine plan optimisation. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/228864

Chicago Manual of Style (16th Edition):

Whittle, David. “Underground mine plan optimisation.” 2019. Doctoral Dissertation, University of Melbourne. Accessed October 25, 2020. http://hdl.handle.net/11343/228864.

MLA Handbook (7th Edition):

Whittle, David. “Underground mine plan optimisation.” 2019. Web. 25 Oct 2020.

Vancouver:

Whittle D. Underground mine plan optimisation. [Internet] [Doctoral dissertation]. University of Melbourne; 2019. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/11343/228864.

Council of Science Editors:

Whittle D. Underground mine plan optimisation. [Doctoral Dissertation]. University of Melbourne; 2019. Available from: http://hdl.handle.net/11343/228864


University of Cincinnati

7. KO, MYUNG CHUL. VISUALIZATION OF THE STEINER TREE HEURISTIC SOLUTIONS WITH LEDA.

Degree: MS, Engineering : Computer Science, 2002, University of Cincinnati

Steiner tree problem can be summarized as finding the minimum cost subtree or subnetwork (minimum Steiner tree) spanning a subset of vertices identified as terminals… (more)

Subjects/Keywords: Computer Science; Steiner tree problem; Heuristic solutions; LEDA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

KO, M. C. (2002). VISUALIZATION OF THE STEINER TREE HEURISTIC SOLUTIONS WITH LEDA. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1029528330

Chicago Manual of Style (16th Edition):

KO, MYUNG CHUL. “VISUALIZATION OF THE STEINER TREE HEURISTIC SOLUTIONS WITH LEDA.” 2002. Masters Thesis, University of Cincinnati. Accessed October 25, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1029528330.

MLA Handbook (7th Edition):

KO, MYUNG CHUL. “VISUALIZATION OF THE STEINER TREE HEURISTIC SOLUTIONS WITH LEDA.” 2002. Web. 25 Oct 2020.

Vancouver:

KO MC. VISUALIZATION OF THE STEINER TREE HEURISTIC SOLUTIONS WITH LEDA. [Internet] [Masters thesis]. University of Cincinnati; 2002. [cited 2020 Oct 25]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1029528330.

Council of Science Editors:

KO MC. VISUALIZATION OF THE STEINER TREE HEURISTIC SOLUTIONS WITH LEDA. [Masters Thesis]. University of Cincinnati; 2002. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1029528330


Penn State University

8. Seo, Minseok. APPLICATIONS OF THE ANT COLONY OPTIMIZATION ALGORITHM IN COMBINATORIAL OPTIMIZATION .

Degree: 2008, Penn State University

 Ant colony optimization (ACO) is a metahueristic algorithm, originally developed for the traveling salesman problem. The main idea of ACO came from the ants’ communicative… (more)

Subjects/Keywords: job-shop scheduling problem; Steiner tree problem; ant colony optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Seo, M. (2008). APPLICATIONS OF THE ANT COLONY OPTIMIZATION ALGORITHM IN COMBINATORIAL OPTIMIZATION . (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/9204

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Seo, Minseok. “APPLICATIONS OF THE ANT COLONY OPTIMIZATION ALGORITHM IN COMBINATORIAL OPTIMIZATION .” 2008. Thesis, Penn State University. Accessed October 25, 2020. https://submit-etda.libraries.psu.edu/catalog/9204.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Seo, Minseok. “APPLICATIONS OF THE ANT COLONY OPTIMIZATION ALGORITHM IN COMBINATORIAL OPTIMIZATION .” 2008. Web. 25 Oct 2020.

Vancouver:

Seo M. APPLICATIONS OF THE ANT COLONY OPTIMIZATION ALGORITHM IN COMBINATORIAL OPTIMIZATION . [Internet] [Thesis]. Penn State University; 2008. [cited 2020 Oct 25]. Available from: https://submit-etda.libraries.psu.edu/catalog/9204.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Seo M. APPLICATIONS OF THE ANT COLONY OPTIMIZATION ALGORITHM IN COMBINATORIAL OPTIMIZATION . [Thesis]. Penn State University; 2008. Available from: https://submit-etda.libraries.psu.edu/catalog/9204

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. Amorim Neto, Alcides de Castro. Problema de Steiner Euclidiano aplicado a moléculas de interesse biológico.

Degree: 2007, Universidade Federal do Amazonas

Um problema antigo e de grande aplicação na Matemática Aplicada é conhecido como problema de Steiner, que consiste na determinação de um ponto que minimize… (more)

Subjects/Keywords: Problema de Steiner; Razão de Steiner; Árvores mínimas de Steiner (SMTs); Configuração mínima de energia; Problem of Steiner; Ratio Steiner; Minimum configuration of energy; CIÊNCIAS EXATAS E DA TERRA: MATEMÁTICA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Amorim Neto, A. d. C. (2007). Problema de Steiner Euclidiano aplicado a moléculas de interesse biológico. (Masters Thesis). Universidade Federal do Amazonas. Retrieved from http://tede.ufam.edu.br/handle/tede/3687

Chicago Manual of Style (16th Edition):

Amorim Neto, Alcides de Castro. “Problema de Steiner Euclidiano aplicado a moléculas de interesse biológico.” 2007. Masters Thesis, Universidade Federal do Amazonas. Accessed October 25, 2020. http://tede.ufam.edu.br/handle/tede/3687.

MLA Handbook (7th Edition):

Amorim Neto, Alcides de Castro. “Problema de Steiner Euclidiano aplicado a moléculas de interesse biológico.” 2007. Web. 25 Oct 2020.

Vancouver:

Amorim Neto AdC. Problema de Steiner Euclidiano aplicado a moléculas de interesse biológico. [Internet] [Masters thesis]. Universidade Federal do Amazonas; 2007. [cited 2020 Oct 25]. Available from: http://tede.ufam.edu.br/handle/tede/3687.

Council of Science Editors:

Amorim Neto AdC. Problema de Steiner Euclidiano aplicado a moléculas de interesse biológico. [Masters Thesis]. Universidade Federal do Amazonas; 2007. Available from: http://tede.ufam.edu.br/handle/tede/3687


Pontifical Catholic University of Rio de Janeiro

10. CID CARVALHO DE SOUZA. [en] THE STEINER PROBLEM IN RECTILINEAR METRIC: PROPERTIES, NEW HEURISTICS AND COMPUTATIONAL STUDY.

Degree: 2007, Pontifical Catholic University of Rio de Janeiro

[pt] Nesta tese faz-se uma extensa revisão bibliográfica sobre o problema de Steiner na métrica retilínea, destacando-se a aplicação do mesmo no projeto de VLSI.… (more)

Subjects/Keywords: [pt] HEURISTICA; [en] HEURISTICS; [pt] METRICA RETILINEA; [en] RECTILINEAR METRIC; [pt] PROBLEMA DE STEINER; [en] STEINER PROBLEM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

SOUZA, C. C. D. (2007). [en] THE STEINER PROBLEM IN RECTILINEAR METRIC: PROPERTIES, NEW HEURISTICS AND COMPUTATIONAL STUDY. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10236

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

SOUZA, CID CARVALHO DE. “[en] THE STEINER PROBLEM IN RECTILINEAR METRIC: PROPERTIES, NEW HEURISTICS AND COMPUTATIONAL STUDY.” 2007. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed October 25, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10236.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

SOUZA, CID CARVALHO DE. “[en] THE STEINER PROBLEM IN RECTILINEAR METRIC: PROPERTIES, NEW HEURISTICS AND COMPUTATIONAL STUDY.” 2007. Web. 25 Oct 2020.

Vancouver:

SOUZA CCD. [en] THE STEINER PROBLEM IN RECTILINEAR METRIC: PROPERTIES, NEW HEURISTICS AND COMPUTATIONAL STUDY. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2007. [cited 2020 Oct 25]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10236.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

SOUZA CCD. [en] THE STEINER PROBLEM IN RECTILINEAR METRIC: PROPERTIES, NEW HEURISTICS AND COMPUTATIONAL STUDY. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2007. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10236

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université Montpellier II

11. Merabet, Massinissa. Solutions optimales des problèmes de recouvrement sous contraintes sur le degré des nœuds : Optimal solutions of problems of finding spanning tree with constraints on the degree of the nodes.

Degree: Docteur es, Informatique, 2014, Université Montpellier II

Le travail que nous développons dans le cadre de cette thèse s'articule autour des problèmes de recherche de structure de recouvrement de graphes sous contrainte… (more)

Subjects/Keywords: Théorie de graphes; Problèmes de recouvrement; Problème de Steiner sous contraintes sur le degré des nœuds; Hiérarchies et arbres de recouvrement; Optimisation combinatoire; Graph theory; Spanning problems; Steiner problem with constraints on the degree of the nodes; Hierarchies and spanning tree; Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Merabet, M. (2014). Solutions optimales des problèmes de recouvrement sous contraintes sur le degré des nœuds : Optimal solutions of problems of finding spanning tree with constraints on the degree of the nodes. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2014MON20138

Chicago Manual of Style (16th Edition):

Merabet, Massinissa. “Solutions optimales des problèmes de recouvrement sous contraintes sur le degré des nœuds : Optimal solutions of problems of finding spanning tree with constraints on the degree of the nodes.” 2014. Doctoral Dissertation, Université Montpellier II. Accessed October 25, 2020. http://www.theses.fr/2014MON20138.

MLA Handbook (7th Edition):

Merabet, Massinissa. “Solutions optimales des problèmes de recouvrement sous contraintes sur le degré des nœuds : Optimal solutions of problems of finding spanning tree with constraints on the degree of the nodes.” 2014. Web. 25 Oct 2020.

Vancouver:

Merabet M. Solutions optimales des problèmes de recouvrement sous contraintes sur le degré des nœuds : Optimal solutions of problems of finding spanning tree with constraints on the degree of the nodes. [Internet] [Doctoral dissertation]. Université Montpellier II; 2014. [cited 2020 Oct 25]. Available from: http://www.theses.fr/2014MON20138.

Council of Science Editors:

Merabet M. Solutions optimales des problèmes de recouvrement sous contraintes sur le degré des nœuds : Optimal solutions of problems of finding spanning tree with constraints on the degree of the nodes. [Doctoral Dissertation]. Université Montpellier II; 2014. Available from: http://www.theses.fr/2014MON20138

12. Logan, Andrew. The Steiner Problem on Closed Surfaces of Constant Curvature.

Degree: MS, 2015, Brigham Young University

  The n-point Steiner problem in the Euclidean plane is to find a least length path network connecting n points. In this thesis we will… (more)

Subjects/Keywords: Steiner problem; Riemannian manifold; closed surfaces of constant curvature; Mathematics

…Chapter 1. Introduction The n-point Steiner problem (named after Jakob Steiner… …connecting n points on X. Although the Steiner problem in the plane for the 3-point case was… …popularized in 1979 as the Steiner problem by Courant and Robbins who attributed it to Jakob Steiner… …x5B;7]. Many results for the Steiner problem on the plane soon developed [5, 9, 17… …Steiner problem on all surfaces. In this thesis, we look at solving the Steiner problem on… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Logan, A. (2015). The Steiner Problem on Closed Surfaces of Constant Curvature. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=5419&context=etd

Chicago Manual of Style (16th Edition):

Logan, Andrew. “The Steiner Problem on Closed Surfaces of Constant Curvature.” 2015. Masters Thesis, Brigham Young University. Accessed October 25, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=5419&context=etd.

MLA Handbook (7th Edition):

Logan, Andrew. “The Steiner Problem on Closed Surfaces of Constant Curvature.” 2015. Web. 25 Oct 2020.

Vancouver:

Logan A. The Steiner Problem on Closed Surfaces of Constant Curvature. [Internet] [Masters thesis]. Brigham Young University; 2015. [cited 2020 Oct 25]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=5419&context=etd.

Council of Science Editors:

Logan A. The Steiner Problem on Closed Surfaces of Constant Curvature. [Masters Thesis]. Brigham Young University; 2015. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=5419&context=etd


University of Maryland

13. Frommer, Ian. MODELING AND OPTIMIZATION OF TRANSMISSION NETWORKS.

Degree: Applied Mathematics and Scientific Computation, 2005, University of Maryland

 This dissertation focuses on transmission networks. These networks play an important role in communication (including data and voice), energy transmission (such as gas, electrical, and… (more)

Subjects/Keywords: Mathematics; Operations Research; computer networks; mathematical modeling; steiner tree problem; genetic algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Frommer, I. (2005). MODELING AND OPTIMIZATION OF TRANSMISSION NETWORKS. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/2448

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Frommer, Ian. “MODELING AND OPTIMIZATION OF TRANSMISSION NETWORKS.” 2005. Thesis, University of Maryland. Accessed October 25, 2020. http://hdl.handle.net/1903/2448.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Frommer, Ian. “MODELING AND OPTIMIZATION OF TRANSMISSION NETWORKS.” 2005. Web. 25 Oct 2020.

Vancouver:

Frommer I. MODELING AND OPTIMIZATION OF TRANSMISSION NETWORKS. [Internet] [Thesis]. University of Maryland; 2005. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/1903/2448.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Frommer I. MODELING AND OPTIMIZATION OF TRANSMISSION NETWORKS. [Thesis]. University of Maryland; 2005. Available from: http://hdl.handle.net/1903/2448

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Tibboel, M. Creating high quality indicative routes in heterogeneous virtual environments.

Degree: 2013, Universiteit Utrecht

 In this thesis we will attempt to close the gap between fast grid-based method and epsilon-approximation methods that solve the Weighted Region problem. In order… (more)

Subjects/Keywords: Weighted region problem; epsilon-approximation; Steiner points; pruned-graph methods; A*

…of the scene. 2.1.6 Extensions to the path planning problem In addition to the… …planning problem. There are many extensions to the path planning problem, but we will only… …problem. Extension to disk-shaped characters with variable radius The first extension we will… …planning problem is the extension to finding smooth paths that are visually convincing for… …detection algorithm along spline trajectories. Zhao [33] formulates the problem as a… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tibboel, M. (2013). Creating high quality indicative routes in heterogeneous virtual environments. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/280265

Chicago Manual of Style (16th Edition):

Tibboel, M. “Creating high quality indicative routes in heterogeneous virtual environments.” 2013. Masters Thesis, Universiteit Utrecht. Accessed October 25, 2020. http://dspace.library.uu.nl:8080/handle/1874/280265.

MLA Handbook (7th Edition):

Tibboel, M. “Creating high quality indicative routes in heterogeneous virtual environments.” 2013. Web. 25 Oct 2020.

Vancouver:

Tibboel M. Creating high quality indicative routes in heterogeneous virtual environments. [Internet] [Masters thesis]. Universiteit Utrecht; 2013. [cited 2020 Oct 25]. Available from: http://dspace.library.uu.nl:8080/handle/1874/280265.

Council of Science Editors:

Tibboel M. Creating high quality indicative routes in heterogeneous virtual environments. [Masters Thesis]. Universiteit Utrecht; 2013. Available from: http://dspace.library.uu.nl:8080/handle/1874/280265

15. Vakilian, Ali. Node-weighted prize-collecting survivable network design problems.

Degree: MS, 0112, 2013, University of Illinois – Urbana-Champaign

 We consider node-weighted network design problems, in particular the survivable network design problem SNDP and its prize-collecting version PC-SNDP. The input consists of a node-weighted… (more)

Subjects/Keywords: Approximation Algorithm; Survivable Network Design; Steiner Network; Prize-collecting survivable network design problem (SNDP)

…spanning tree and NP-complete problems such as Steiner tree or forest problem. Edge-weighted SNDP… …weighted Steiner tree problem is already Ω(log n)-hard to approximate via a simple… …Survivable Network Design Problem (SNDP) the input consists of an undirected graph G… …obtained a 2-approximation for this problem via the influential iterated rounding technique that… …problem is much harder in vertex-connectivity setup. While ECSNDP and ELC-SNDP both admits a 2… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vakilian, A. (2013). Node-weighted prize-collecting survivable network design problems. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45452

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vakilian, Ali. “Node-weighted prize-collecting survivable network design problems.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed October 25, 2020. http://hdl.handle.net/2142/45452.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vakilian, Ali. “Node-weighted prize-collecting survivable network design problems.” 2013. Web. 25 Oct 2020.

Vancouver:

Vakilian A. Node-weighted prize-collecting survivable network design problems. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/2142/45452.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vakilian A. Node-weighted prize-collecting survivable network design problems. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45452

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

16. Samanta, Radhamanjari. Timing-Driven Routing in VLSI Physical Design Under Uncertainty.

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

 The multi-net Global Routing Problem (GRP) in VLSI physical design is a problem of routing a set of nets subject to limited resources and delay… (more)

Subjects/Keywords: Very Large Scale Integration; Integrated Circuits; Global Routing Algorithm; Timing-Driven Routing - VLSI; Very Large Scale Integration (VLSI) Physical Design; Global Router; Global Routing Problem (GRP); Gaussian Random Variables; Steiner Tree Construction; Global Routing Model; Electronic Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Samanta, R. (2018). Timing-Driven Routing in VLSI Physical Design Under Uncertainty. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3444

Chicago Manual of Style (16th Edition):

Samanta, Radhamanjari. “Timing-Driven Routing in VLSI Physical Design Under Uncertainty.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed October 25, 2020. http://etd.iisc.ac.in/handle/2005/3444.

MLA Handbook (7th Edition):

Samanta, Radhamanjari. “Timing-Driven Routing in VLSI Physical Design Under Uncertainty.” 2018. Web. 25 Oct 2020.

Vancouver:

Samanta R. Timing-Driven Routing in VLSI Physical Design Under Uncertainty. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2020 Oct 25]. Available from: http://etd.iisc.ac.in/handle/2005/3444.

Council of Science Editors:

Samanta R. Timing-Driven Routing in VLSI Physical Design Under Uncertainty. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3444


University of Sydney

17. Sheppard, Nicholas Paul. Self-Reduction for Combinatorial Optimisation .

Degree: 2001, University of Sydney

 This thesis presents and develops a theory of self-reduction. This process is used to map instances of combinatorial optimisation problems onto smaller, more easily solvable… (more)

Subjects/Keywords: combinatorial optmisation; self-reduction; confluence; decomposition; graph colouring; steiner problem; bin packing; set covering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sheppard, N. P. (2001). Self-Reduction for Combinatorial Optimisation . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/797

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sheppard, Nicholas Paul. “Self-Reduction for Combinatorial Optimisation .” 2001. Thesis, University of Sydney. Accessed October 25, 2020. http://hdl.handle.net/2123/797.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sheppard, Nicholas Paul. “Self-Reduction for Combinatorial Optimisation .” 2001. Web. 25 Oct 2020.

Vancouver:

Sheppard NP. Self-Reduction for Combinatorial Optimisation . [Internet] [Thesis]. University of Sydney; 2001. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/2123/797.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sheppard NP. Self-Reduction for Combinatorial Optimisation . [Thesis]. University of Sydney; 2001. Available from: http://hdl.handle.net/2123/797

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Βροντής, Σταύρος. Πολλαπλή διανομή κίνησης σε δίκτυα διαφοροποιημένων υπηρεσιών με υποστήριξη κινητικότητας χρηστών.

Degree: 2005, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

Subjects/Keywords: Πολλαπλή διανομή κίνησης; Ποιότητα υπηρεσιών; Υπηρεσίες, Διαφοροποιημένες; Δίκτυα κινητά; Δίκτυα, Διαχείριση; Πρόβλημα δέντρου Steiner; Multicast; Quality of services (QoS); Differentiated services; Mobile networks; User mobility; Active networks; Network management; Steiner tree problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Βροντής, . . (2005). Πολλαπλή διανομή κίνησης σε δίκτυα διαφοροποιημένων υπηρεσιών με υποστήριξη κινητικότητας χρηστών. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/16926

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Βροντής, Σταύρος. “Πολλαπλή διανομή κίνησης σε δίκτυα διαφοροποιημένων υπηρεσιών με υποστήριξη κινητικότητας χρηστών.” 2005. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed October 25, 2020. http://hdl.handle.net/10442/hedi/16926.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Βροντής, Σταύρος. “Πολλαπλή διανομή κίνησης σε δίκτυα διαφοροποιημένων υπηρεσιών με υποστήριξη κινητικότητας χρηστών.” 2005. Web. 25 Oct 2020.

Vancouver:

Βροντής . Πολλαπλή διανομή κίνησης σε δίκτυα διαφοροποιημένων υπηρεσιών με υποστήριξη κινητικότητας χρηστών. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2005. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/10442/hedi/16926.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Βροντής . Πολλαπλή διανομή κίνησης σε δίκτυα διαφοροποιημένων υπηρεσιών με υποστήριξη κινητικότητας χρηστών. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2005. Available from: http://hdl.handle.net/10442/hedi/16926

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

19. Mudgal, Apurva. Worst-case robot navigation in deterministic environments.

Degree: PhD, Computing, 2009, Georgia Tech

 We design and analyze algorithms for the following two robot navigation problems: 1. TARGET SEARCH. Given a robot located at a point s in the… (more)

Subjects/Keywords: Worst-case robot navigation; Dynamic A*; Robot localization problem; Approximation algorithm; Group Steiner tree problem; Robots Control systems; Robotics; Computer algorithms; Algorithms; Mobile robots; Autonomous robots Control systems

…the -Group Steiner problem. We also extend the problem to polygonal maps by discretizing the… …uncertainty and permits a link to the -Group Steiner (not Group Steiner) problem. An… …instance of the Group Steiner problem consists of a weighted graph of vertices… …contains at ✛✚ least one vertex from each group. In the -Group Steiner problem, the objective… …localization as a Steiner type problem on a graph, although we are not able to model localization as… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mudgal, A. (2009). Worst-case robot navigation in deterministic environments. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/33924

Chicago Manual of Style (16th Edition):

Mudgal, Apurva. “Worst-case robot navigation in deterministic environments.” 2009. Doctoral Dissertation, Georgia Tech. Accessed October 25, 2020. http://hdl.handle.net/1853/33924.

MLA Handbook (7th Edition):

Mudgal, Apurva. “Worst-case robot navigation in deterministic environments.” 2009. Web. 25 Oct 2020.

Vancouver:

Mudgal A. Worst-case robot navigation in deterministic environments. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/1853/33924.

Council of Science Editors:

Mudgal A. Worst-case robot navigation in deterministic environments. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/33924

.