Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Approximation algorithms)`

.
Showing records 1 – 30 of
390 total matches.

◁ [1] [2] [3] [4] [5] … [13] ▶

Search Limiters

Dates

- 2017 – 2021 (98)
- 2012 – 2016 (155)
- 2007 – 2011 (111)
- 2002 – 2006 (35)

Universities

Department

Degrees

- PhD (115)
- Docteur es (23)
- MS (15)

Languages

- English (249)
- Portuguese (22)
- Greek (15)

▼ Search Limiters

1.
Das, Aparna.
* Approximation* Schemes for Euclidean Vehicle Routing
Problems.

Degree: PhD, Computer Science, 2011, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:11205/

► Vehicle routing is a class of optimization problems where the objective is to find low cost delivery routes from depots to customers using vehicles of…
(more)

Subjects/Keywords: Geometric Approximation Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Das, A. (2011). Approximation Schemes for Euclidean Vehicle Routing Problems. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11205/

Chicago Manual of Style (16^{th} Edition):

Das, Aparna. “Approximation Schemes for Euclidean Vehicle Routing Problems.” 2011. Doctoral Dissertation, Brown University. Accessed April 17, 2021. https://repository.library.brown.edu/studio/item/bdr:11205/.

MLA Handbook (7^{th} Edition):

Das, Aparna. “Approximation Schemes for Euclidean Vehicle Routing Problems.” 2011. Web. 17 Apr 2021.

Vancouver:

Das A. Approximation Schemes for Euclidean Vehicle Routing Problems. [Internet] [Doctoral dissertation]. Brown University; 2011. [cited 2021 Apr 17]. Available from: https://repository.library.brown.edu/studio/item/bdr:11205/.

Council of Science Editors:

Das A. Approximation Schemes for Euclidean Vehicle Routing Problems. [Doctoral Dissertation]. Brown University; 2011. Available from: https://repository.library.brown.edu/studio/item/bdr:11205/

Cornell University

2.
Cheung, Maurice.
Lp-Based *Approximation* *Algorithms* For Scheduling And Inventory Management Problems.

Degree: PhD, Operations Research, 2012, Cornell University

URL: http://hdl.handle.net/1813/31470

► There are two fundamental approaches for using linear programming in designing *approximation* *algorithms*: LP-rounding and the primal-dual method. In this thesis, we develop LP-based *approximation*…
(more)

Subjects/Keywords: Approximation Algorithms; Scheduling; Inventory Management

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cheung, M. (2012). Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/31470

Chicago Manual of Style (16^{th} Edition):

Cheung, Maurice. “Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems.” 2012. Doctoral Dissertation, Cornell University. Accessed April 17, 2021. http://hdl.handle.net/1813/31470.

MLA Handbook (7^{th} Edition):

Cheung, Maurice. “Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems.” 2012. Web. 17 Apr 2021.

Vancouver:

Cheung M. Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1813/31470.

Council of Science Editors:

Cheung M. Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems. [Doctoral Dissertation]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31470

Cornell University

3.
Svitkina, Zoya.
*Approximation**algorithms* for new graph partitioning and facility location problems.

Degree: 2007, Cornell University

URL: http://hdl.handle.net/1813/8156

► In applications as diverse as data placement in peer-to-peer systems, control of epidemic outbreaks, and routing in sensor networks, the fundamental questions can be abstracted…
(more)

Subjects/Keywords: approximation; algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Svitkina, Z. (2007). Approximation algorithms for new graph partitioning and facility location problems. (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/8156

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Svitkina, Zoya. “Approximation algorithms for new graph partitioning and facility location problems.” 2007. Thesis, Cornell University. Accessed April 17, 2021. http://hdl.handle.net/1813/8156.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Svitkina, Zoya. “Approximation algorithms for new graph partitioning and facility location problems.” 2007. Web. 17 Apr 2021.

Vancouver:

Svitkina Z. Approximation algorithms for new graph partitioning and facility location problems. [Internet] [Thesis]. Cornell University; 2007. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1813/8156.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Svitkina Z. Approximation algorithms for new graph partitioning and facility location problems. [Thesis]. Cornell University; 2007. Available from: http://hdl.handle.net/1813/8156

Not specified: Masters Thesis or Doctoral Dissertation

4.
Allbee, Matthew.
An *approximation* algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.

Degree: 2018, University of Wisconsin – Whitewater

URL: http://digital.library.wisc.edu/1793/78968

►

This file was last viewed in Microsoft Edge.

Substantial work has gone into ﬁnding techniques for solving real-world sized Nash games. Stackelberg Equilibria is another… (more)

Subjects/Keywords: Game theory; Approximation algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Allbee, M. (2018). An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. (Thesis). University of Wisconsin – Whitewater. Retrieved from http://digital.library.wisc.edu/1793/78968

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Allbee, Matthew. “An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.” 2018. Thesis, University of Wisconsin – Whitewater. Accessed April 17, 2021. http://digital.library.wisc.edu/1793/78968.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Allbee, Matthew. “An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.” 2018. Web. 17 Apr 2021.

Vancouver:

Allbee M. An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. [Internet] [Thesis]. University of Wisconsin – Whitewater; 2018. [cited 2021 Apr 17]. Available from: http://digital.library.wisc.edu/1793/78968.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Allbee M. An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. [Thesis]. University of Wisconsin – Whitewater; 2018. Available from: http://digital.library.wisc.edu/1793/78968

Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

5. Cao, Junhong CSE. Counting cycles by random sampling : theory and practice.

Degree: 2019, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-102333 ; https://doi.org/10.14711/thesis-991012757569503412 ; http://repository.ust.hk/ir/bitstream/1783.1-102333/1/th_redirect.html

► The problem of our interest is counting k-node cycles and other subgraphs containing such cycles. Practical performance of exact counting methods is good only on…
(more)

Subjects/Keywords: Sampling (Statistics) ; Approximation algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cao, J. C. (2019). Counting cycles by random sampling : theory and practice. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-102333 ; https://doi.org/10.14711/thesis-991012757569503412 ; http://repository.ust.hk/ir/bitstream/1783.1-102333/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Cao, Junhong CSE. “Counting cycles by random sampling : theory and practice.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed April 17, 2021. http://repository.ust.hk/ir/Record/1783.1-102333 ; https://doi.org/10.14711/thesis-991012757569503412 ; http://repository.ust.hk/ir/bitstream/1783.1-102333/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cao, Junhong CSE. “Counting cycles by random sampling : theory and practice.” 2019. Web. 17 Apr 2021.

Vancouver:

Cao JC. Counting cycles by random sampling : theory and practice. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2021 Apr 17]. Available from: http://repository.ust.hk/ir/Record/1783.1-102333 ; https://doi.org/10.14711/thesis-991012757569503412 ; http://repository.ust.hk/ir/bitstream/1783.1-102333/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cao JC. Counting cycles by random sampling : theory and practice. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-102333 ; https://doi.org/10.14711/thesis-991012757569503412 ; http://repository.ust.hk/ir/bitstream/1783.1-102333/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

6.
Younis, Adel Ayad Hassouna.
Space exploration and region elimination global optimization *algorithms* for multidisciplinary design optimization.

Degree: Dept. of Mechanical Engineering, 2011, University of Victoria

URL: http://hdl.handle.net/1828/3325

► In modern day engineering, the designer has become more and more dependent on computer simulation. Oftentimes, computational cost and convergence accuracy accompany these simulations to…
(more)

Subjects/Keywords: approximation models; computer simulation; algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Younis, A. A. H. (2011). Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3325

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Younis, Adel Ayad Hassouna. “Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization.” 2011. Thesis, University of Victoria. Accessed April 17, 2021. http://hdl.handle.net/1828/3325.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Younis, Adel Ayad Hassouna. “Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization.” 2011. Web. 17 Apr 2021.

Vancouver:

Younis AAH. Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization. [Internet] [Thesis]. University of Victoria; 2011. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1828/3325.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Younis AAH. Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization. [Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3325

Not specified: Masters Thesis or Doctoral Dissertation

Princeton University

7. Naamad, Yonatan. Hardness from Densest Subgraph Conjectures .

Degree: PhD, 2017, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp01f7623g24h

► Karp's seminal paper on NP-Completeness provided computer scientists with a toolkit for showing computational hardness, conditioned on a complexity theoretic conjecture, for a wide variety…
(more)

Subjects/Keywords: Algorithms; Approximation; Densest Subgraph; Hardness

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Naamad, Y. (2017). Hardness from Densest Subgraph Conjectures . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01f7623g24h

Chicago Manual of Style (16^{th} Edition):

Naamad, Yonatan. “Hardness from Densest Subgraph Conjectures .” 2017. Doctoral Dissertation, Princeton University. Accessed April 17, 2021. http://arks.princeton.edu/ark:/88435/dsp01f7623g24h.

MLA Handbook (7^{th} Edition):

Naamad, Yonatan. “Hardness from Densest Subgraph Conjectures .” 2017. Web. 17 Apr 2021.

Vancouver:

Naamad Y. Hardness from Densest Subgraph Conjectures . [Internet] [Doctoral dissertation]. Princeton University; 2017. [cited 2021 Apr 17]. Available from: http://arks.princeton.edu/ark:/88435/dsp01f7623g24h.

Council of Science Editors:

Naamad Y. Hardness from Densest Subgraph Conjectures . [Doctoral Dissertation]. Princeton University; 2017. Available from: http://arks.princeton.edu/ark:/88435/dsp01f7623g24h

University of Waterloo

8.
Blanco Sandoval, Marco David.
LP-based *Approximation* *Algorithms* for the Capacitated Facility Location Problem.

Degree: 2012, University of Waterloo

URL: http://hdl.handle.net/10012/6733

► The capacitated facility location problem is a well known problem in combinatorial optimization and operations research. In it, we are given a set of clients…
(more)

Subjects/Keywords: capacitated facility location; approximation algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Blanco Sandoval, M. D. (2012). LP-based Approximation Algorithms for the Capacitated Facility Location Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6733

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Blanco Sandoval, Marco David. “LP-based Approximation Algorithms for the Capacitated Facility Location Problem.” 2012. Thesis, University of Waterloo. Accessed April 17, 2021. http://hdl.handle.net/10012/6733.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Blanco Sandoval, Marco David. “LP-based Approximation Algorithms for the Capacitated Facility Location Problem.” 2012. Web. 17 Apr 2021.

Vancouver:

Blanco Sandoval MD. LP-based Approximation Algorithms for the Capacitated Facility Location Problem. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/10012/6733.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Blanco Sandoval MD. LP-based Approximation Algorithms for the Capacitated Facility Location Problem. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6733

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

9.
Naumovitz, Timothy Ryan.
Very efficient *approximation* *algorithms* to edit distance problems.

Degree: PhD, Mathematics, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

►

This thesis deals with the question of approximating distance to monotonicity in the streaming setting as well as the task of approximating the ulam distance… (more)

Subjects/Keywords: Computer algorithms; Approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Naumovitz, T. R. (2016). Very efficient approximation algorithms to edit distance problems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

Chicago Manual of Style (16^{th} Edition):

Naumovitz, Timothy Ryan. “Very efficient approximation algorithms to edit distance problems.” 2016. Doctoral Dissertation, Rutgers University. Accessed April 17, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/51382/.

MLA Handbook (7^{th} Edition):

Naumovitz, Timothy Ryan. “Very efficient approximation algorithms to edit distance problems.” 2016. Web. 17 Apr 2021.

Vancouver:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2021 Apr 17]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/.

Council of Science Editors:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

Rutgers University

10.
Liu, Liu.
Trading quality for resource consumption through *approximation* management.

Degree: PhD, Computer Science, 2020, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/62749/

►

The goal of traditional optimizations is to map applications onto limited machine resources such that application performance is maximized while application semantics (program correctness), is… (more)

Subjects/Keywords: Approximate computation; Approximation algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, L. (2020). Trading quality for resource consumption through approximation management. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/62749/

Chicago Manual of Style (16^{th} Edition):

Liu, Liu. “Trading quality for resource consumption through approximation management.” 2020. Doctoral Dissertation, Rutgers University. Accessed April 17, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/62749/.

MLA Handbook (7^{th} Edition):

Liu, Liu. “Trading quality for resource consumption through approximation management.” 2020. Web. 17 Apr 2021.

Vancouver:

Liu L. Trading quality for resource consumption through approximation management. [Internet] [Doctoral dissertation]. Rutgers University; 2020. [cited 2021 Apr 17]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/62749/.

Council of Science Editors:

Liu L. Trading quality for resource consumption through approximation management. [Doctoral Dissertation]. Rutgers University; 2020. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/62749/

Penn State University

11. Dixit, Kashyap. Robust Models For Property Testing.

Degree: 2015, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/27153

► Property testing [Rubinfeld Sudan 96,Goldreich Goldwasser Ron 98] is a formal framework for studying approximate sublinear time randomized *algorithms* for decision problems. These *algorithms* have…
(more)

Subjects/Keywords: Property Testing; Sublinear Algorithms; Randomized Algorithms; Approximation Algorithms; Theoretical Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dixit, K. (2015). Robust Models For Property Testing. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/27153

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Thesis, Penn State University. Accessed April 17, 2021. https://submit-etda.libraries.psu.edu/catalog/27153.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Web. 17 Apr 2021.

Vancouver:

Dixit K. Robust Models For Property Testing. [Internet] [Thesis]. Penn State University; 2015. [cited 2021 Apr 17]. Available from: https://submit-etda.libraries.psu.edu/catalog/27153.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dixit K. Robust Models For Property Testing. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/27153

Not specified: Masters Thesis or Doctoral Dissertation

12. Martens, Maren. path-constrained network flows.

Degree: 2007, Technische Universität Dortmund

URL: http://hdl.handle.net/2003/24272

► This thesis focuses on *approximation* *algorithms* and complexity assessments concerning network flows. It deals with various network flow problems with path restrictions. These restrictions cover…
(more)

Subjects/Keywords: approximation algorithms; discrete optimization; network flows; 510

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Martens, M. (2007). path-constrained network flows. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/24272

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Martens, Maren. “path-constrained network flows.” 2007. Thesis, Technische Universität Dortmund. Accessed April 17, 2021. http://hdl.handle.net/2003/24272.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Martens, Maren. “path-constrained network flows.” 2007. Web. 17 Apr 2021.

Vancouver:

Martens M. path-constrained network flows. [Internet] [Thesis]. Technische Universität Dortmund; 2007. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/2003/24272.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Martens M. path-constrained network flows. [Thesis]. Technische Universität Dortmund; 2007. Available from: http://hdl.handle.net/2003/24272

Not specified: Masters Thesis or Doctoral Dissertation

Columbia University

13.
Qiu, Zhen.
*Approximation**Algorithms* for Demand-Response Contract Execution and Coflow Scheduling.

Degree: 2016, Columbia University

URL: https://doi.org/10.7916/D8FQ9WVP

► Solving operations research problems with *approximation* *algorithms* has been an important topic since *approximation* algorithm can provide near-optimal solutions to NP-hard problems while achieving computational…
(more)

Subjects/Keywords: Approximation algorithms; Mathematical optimization; Scheduling; Operations research

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Qiu, Z. (2016). Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8FQ9WVP

Chicago Manual of Style (16^{th} Edition):

Qiu, Zhen. “Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling.” 2016. Doctoral Dissertation, Columbia University. Accessed April 17, 2021. https://doi.org/10.7916/D8FQ9WVP.

MLA Handbook (7^{th} Edition):

Qiu, Zhen. “Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling.” 2016. Web. 17 Apr 2021.

Vancouver:

Qiu Z. Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling. [Internet] [Doctoral dissertation]. Columbia University; 2016. [cited 2021 Apr 17]. Available from: https://doi.org/10.7916/D8FQ9WVP.

Council of Science Editors:

Qiu Z. Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling. [Doctoral Dissertation]. Columbia University; 2016. Available from: https://doi.org/10.7916/D8FQ9WVP

University of Ottawa

14. Schultz Xavier da Silveira, Luís Fernando. Turán Triangles, Cell Covers, Road Placement and Train Scheduling .

Degree: 2020, University of Ottawa

URL: http://hdl.handle.net/10393/40569

► In this doctoral thesis, four questions related to computational geometry are considered. The first is an extremal combinatorics question regarding triangles with vertices taken from…
(more)

Subjects/Keywords: Computational Geometry; Combinatorial Optimization; Approximation Algorithms; Scheduling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schultz Xavier da Silveira, L. F. (2020). Turán Triangles, Cell Covers, Road Placement and Train Scheduling . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/40569

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Schultz Xavier da Silveira, Luís Fernando. “Turán Triangles, Cell Covers, Road Placement and Train Scheduling .” 2020. Thesis, University of Ottawa. Accessed April 17, 2021. http://hdl.handle.net/10393/40569.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Schultz Xavier da Silveira, Luís Fernando. “Turán Triangles, Cell Covers, Road Placement and Train Scheduling .” 2020. Web. 17 Apr 2021.

Vancouver:

Schultz Xavier da Silveira LF. Turán Triangles, Cell Covers, Road Placement and Train Scheduling . [Internet] [Thesis]. University of Ottawa; 2020. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/10393/40569.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schultz Xavier da Silveira LF. Turán Triangles, Cell Covers, Road Placement and Train Scheduling . [Thesis]. University of Ottawa; 2020. Available from: http://hdl.handle.net/10393/40569

Not specified: Masters Thesis or Doctoral Dissertation

15.
Sachdeva, Sushant.
New Results in the Theory of *Approximation*: Fast Graph *Algorithms* and Inapproximability
.

Degree: PhD, 2013, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp01rn301150n

► For several basic optimization problems, it is NP-hard to find an exact solution. As a result, understanding the best possible trade-off between the running time…
(more)

Subjects/Keywords: Algorithms; Approximation; Exponential; Graph Partitioning; Hardness

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sachdeva, S. (2013). New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01rn301150n

Chicago Manual of Style (16^{th} Edition):

Sachdeva, Sushant. “New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability .” 2013. Doctoral Dissertation, Princeton University. Accessed April 17, 2021. http://arks.princeton.edu/ark:/88435/dsp01rn301150n.

MLA Handbook (7^{th} Edition):

Sachdeva, Sushant. “New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability .” 2013. Web. 17 Apr 2021.

Vancouver:

Sachdeva S. New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . [Internet] [Doctoral dissertation]. Princeton University; 2013. [cited 2021 Apr 17]. Available from: http://arks.princeton.edu/ark:/88435/dsp01rn301150n.

Council of Science Editors:

Sachdeva S. New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . [Doctoral Dissertation]. Princeton University; 2013. Available from: http://arks.princeton.edu/ark:/88435/dsp01rn301150n

University of Lethbridge

16. University of Lethbridge. Faculty of Arts and Science. Investigations on two classes of covering problems .

Degree: 2017, University of Lethbridge

URL: http://hdl.handle.net/10133/4774

► Covering problems fall within the broader category of facility location, a branch of combinatorial optimization concerned with the optimal placement of service facilities in some…
(more)

Subjects/Keywords: approximation algorithms; covering problems; facility location

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Science, U. o. L. F. o. A. a. (2017). Investigations on two classes of covering problems . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/4774

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Science, University of Lethbridge. Faculty of Arts and. “Investigations on two classes of covering problems .” 2017. Thesis, University of Lethbridge. Accessed April 17, 2021. http://hdl.handle.net/10133/4774.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Science, University of Lethbridge. Faculty of Arts and. “Investigations on two classes of covering problems .” 2017. Web. 17 Apr 2021.

Vancouver:

Science UoLFoAa. Investigations on two classes of covering problems . [Internet] [Thesis]. University of Lethbridge; 2017. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/10133/4774.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Science UoLFoAa. Investigations on two classes of covering problems . [Thesis]. University of Lethbridge; 2017. Available from: http://hdl.handle.net/10133/4774

Not specified: Masters Thesis or Doctoral Dissertation

University of Maryland

17.
Kumar, Saurabh.
Combinatorial *Algorithms* for the Active Time and Busy Time Problems.

Degree: Computer Science, 2016, University of Maryland

URL: http://hdl.handle.net/1903/19023

► In this thesis, we consider the problem of scheduling jobs in such a way that we minimize the energy consumption of the machines they are…
(more)

Subjects/Keywords: Computer science; Approximation Algorithms; Job Scheduling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kumar, S. (2016). Combinatorial Algorithms for the Active Time and Busy Time Problems. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/19023

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kumar, Saurabh. “Combinatorial Algorithms for the Active Time and Busy Time Problems.” 2016. Thesis, University of Maryland. Accessed April 17, 2021. http://hdl.handle.net/1903/19023.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kumar, Saurabh. “Combinatorial Algorithms for the Active Time and Busy Time Problems.” 2016. Web. 17 Apr 2021.

Vancouver:

Kumar S. Combinatorial Algorithms for the Active Time and Busy Time Problems. [Internet] [Thesis]. University of Maryland; 2016. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1903/19023.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kumar S. Combinatorial Algorithms for the Active Time and Busy Time Problems. [Thesis]. University of Maryland; 2016. Available from: http://hdl.handle.net/1903/19023

Not specified: Masters Thesis or Doctoral Dissertation

University of Alberta

18.
Khani, Mohammad Reza.
Improved *approximation* *algorithms* for Min-Max Tree Cover,
Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree,
and (k, 2)-Subgraph.

Degree: MS, Department of Computing Science, 2011, University of Alberta

URL: https://era.library.ualberta.ca/files/cbr86b369q

► In this thesis we provide improved *approximation* *algorithms* for the Min-Max k-Tree Cover, Bounded Tree Cover and Shallow-Light k-Steiner Tree, (k, 2)-subgraph problems. In Chapter…
(more)

Subjects/Keywords: Theory of Computation; Approximation Algorithms; CombinatorialOptimization; Hardness of Approximation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khani, M. R. (2011). Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cbr86b369q

Chicago Manual of Style (16^{th} Edition):

Khani, Mohammad Reza. “Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph.” 2011. Masters Thesis, University of Alberta. Accessed April 17, 2021. https://era.library.ualberta.ca/files/cbr86b369q.

MLA Handbook (7^{th} Edition):

Khani, Mohammad Reza. “Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph.” 2011. Web. 17 Apr 2021.

Vancouver:

Khani MR. Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2021 Apr 17]. Available from: https://era.library.ualberta.ca/files/cbr86b369q.

Council of Science Editors:

Khani MR. Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/cbr86b369q

19. Briest, Patrick. Computational aspects of combinatorial pricing problems.

Degree: 2007, Technische Universität Dortmund

URL: http://hdl.handle.net/2003/24877

► Combinatorial pricing encompasses a wide range of natural optimization problems that arise in the computation of revenue maximizing pricing schemes for a given set of…
(more)

Subjects/Keywords: algorithmic game theory; approximation algorithms; hardness of approximation; pricing; 004

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Briest, P. (2007). Computational aspects of combinatorial pricing problems. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/24877

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Thesis, Technische Universität Dortmund. Accessed April 17, 2021. http://hdl.handle.net/2003/24877.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Web. 17 Apr 2021.

Vancouver:

Briest P. Computational aspects of combinatorial pricing problems. [Internet] [Thesis]. Technische Universität Dortmund; 2007. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/2003/24877.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Briest P. Computational aspects of combinatorial pricing problems. [Thesis]. Technische Universität Dortmund; 2007. Available from: http://hdl.handle.net/2003/24877

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

20.
An, Hyung Chan.
*Approximation**Algorithms* For Traveling Salesman Problems Based On Linear Programming Relaxations.

Degree: PhD, Computer Science, 2012, Cornell University

URL: http://hdl.handle.net/1813/31039

► The traveling salesman problem (TSP) is the problem of finding a shortest Hamiltonian circuit or path in a given weighted graph. This problem has been…
(more)

Subjects/Keywords: approximation algorithms; traveling salesman problem; LP relaxations and rounding algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

An, H. C. (2012). Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/31039

Chicago Manual of Style (16^{th} Edition):

An, Hyung Chan. “Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations.” 2012. Doctoral Dissertation, Cornell University. Accessed April 17, 2021. http://hdl.handle.net/1813/31039.

MLA Handbook (7^{th} Edition):

An, Hyung Chan. “Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations.” 2012. Web. 17 Apr 2021.

Vancouver:

An HC. Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1813/31039.

Council of Science Editors:

An HC. Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations. [Doctoral Dissertation]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31039

Penn State University

21. Li, Zhenyao. Greedy Algorithm for approximating maximum induced matching.

Degree: 2014, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/22793

► An induced matching in a graph G=(V,E) is M\subseteq E such that it is a matching and also the edge set of an induced subgraph…
(more)

Subjects/Keywords: graph theory; combinatorial problem; approximation algorithms; induced matching; greedy algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, Z. (2014). Greedy Algorithm for approximating maximum induced matching. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/22793

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Thesis, Penn State University. Accessed April 17, 2021. https://submit-etda.libraries.psu.edu/catalog/22793.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Web. 17 Apr 2021.

Vancouver:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Internet] [Thesis]. Penn State University; 2014. [cited 2021 Apr 17]. Available from: https://submit-etda.libraries.psu.edu/catalog/22793.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Thesis]. Penn State University; 2014. Available from: https://submit-etda.libraries.psu.edu/catalog/22793

Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

22. Mao, Yuchen CSE. Resource allocation in a fair manner.

Degree: 2019, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-102371 ; https://doi.org/10.14711/thesis-991012758169303412 ; http://repository.ust.hk/ir/bitstream/1783.1-102371/1/th_redirect.html

► The max-min fair allocation problem, also known as the Santa Claus problem, is a fundamental problem in combinatorial optimization. Given a set of players P,…
(more)

Subjects/Keywords: Resource allocation ; Mathematical models ; Assignment problems (Programming) ; Computer algorithms ; Approximation algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mao, Y. C. (2019). Resource allocation in a fair manner. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-102371 ; https://doi.org/10.14711/thesis-991012758169303412 ; http://repository.ust.hk/ir/bitstream/1783.1-102371/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Mao, Yuchen CSE. “Resource allocation in a fair manner.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed April 17, 2021. http://repository.ust.hk/ir/Record/1783.1-102371 ; https://doi.org/10.14711/thesis-991012758169303412 ; http://repository.ust.hk/ir/bitstream/1783.1-102371/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mao, Yuchen CSE. “Resource allocation in a fair manner.” 2019. Web. 17 Apr 2021.

Vancouver:

Mao YC. Resource allocation in a fair manner. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2021 Apr 17]. Available from: http://repository.ust.hk/ir/Record/1783.1-102371 ; https://doi.org/10.14711/thesis-991012758169303412 ; http://repository.ust.hk/ir/bitstream/1783.1-102371/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mao YC. Resource allocation in a fair manner. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-102371 ; https://doi.org/10.14711/thesis-991012758169303412 ; http://repository.ust.hk/ir/bitstream/1783.1-102371/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

University of Iowa

23. Kanade, Gaurav Nandkumar. Combinatorial optimization problems in geometric settings.

Degree: PhD, Computer Science, 2011, University of Iowa

URL: https://ir.uiowa.edu/etd/1152

► We consider several combinatorial optimization problems in a geometric set- ting. The first problem we consider is the problem of clustering to minimize the…
(more)

Subjects/Keywords: Algorithms; Approximation Algorithms; Computational Geometry; Network Design; Theory; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kanade, G. N. (2011). Combinatorial optimization problems in geometric settings. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/1152

Chicago Manual of Style (16^{th} Edition):

Kanade, Gaurav Nandkumar. “Combinatorial optimization problems in geometric settings.” 2011. Doctoral Dissertation, University of Iowa. Accessed April 17, 2021. https://ir.uiowa.edu/etd/1152.

MLA Handbook (7^{th} Edition):

Kanade, Gaurav Nandkumar. “Combinatorial optimization problems in geometric settings.” 2011. Web. 17 Apr 2021.

Vancouver:

Kanade GN. Combinatorial optimization problems in geometric settings. [Internet] [Doctoral dissertation]. University of Iowa; 2011. [cited 2021 Apr 17]. Available from: https://ir.uiowa.edu/etd/1152.

Council of Science Editors:

Kanade GN. Combinatorial optimization problems in geometric settings. [Doctoral Dissertation]. University of Iowa; 2011. Available from: https://ir.uiowa.edu/etd/1152

University of Illinois – Urbana-Champaign

24. Kumar, Nirman. In search of better proximity.

Degree: PhD, 0112, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/50535

► Given a set of points in a metric space, a fundamental problem is to preprocess these points for answering nearest-neighbor queries on them. Proximity search…
(more)

Subjects/Keywords: Computational Geometry; Algorithms; Data-Structures; Nearest-Neighbor Search; Approximation algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kumar, N. (2014). In search of better proximity. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50535

Chicago Manual of Style (16^{th} Edition):

Kumar, Nirman. “In search of better proximity.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 17, 2021. http://hdl.handle.net/2142/50535.

MLA Handbook (7^{th} Edition):

Kumar, Nirman. “In search of better proximity.” 2014. Web. 17 Apr 2021.

Vancouver:

Kumar N. In search of better proximity. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/2142/50535.

Council of Science Editors:

Kumar N. In search of better proximity. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50535

Virginia Tech

25. Pei, Guanhong. Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model.

Degree: PhD, Electrical Engineering, 2013, Virginia Tech

URL: http://hdl.handle.net/10919/19219

► We investigate diverse aspects of the performance of wireless networks, including throughput, delay and distributed complexity. One of the main challenges for optimizing them arises…
(more)

Subjects/Keywords: Wireless Networks; Cross-layer Design; Physical Interference; Approximation Algorithms; Distributed Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pei, G. (2013). Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/19219

Chicago Manual of Style (16^{th} Edition):

Pei, Guanhong. “Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model.” 2013. Doctoral Dissertation, Virginia Tech. Accessed April 17, 2021. http://hdl.handle.net/10919/19219.

MLA Handbook (7^{th} Edition):

Pei, Guanhong. “Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model.” 2013. Web. 17 Apr 2021.

Vancouver:

Pei G. Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model. [Internet] [Doctoral dissertation]. Virginia Tech; 2013. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/10919/19219.

Council of Science Editors:

Pei G. Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model. [Doctoral Dissertation]. Virginia Tech; 2013. Available from: http://hdl.handle.net/10919/19219

University of Lund

26.
SLEDNEU, DZMITRY.
Studies in Efficient Discrete * Algorithms*.

Degree: 2016, University of Lund

URL: https://lup.lub.lu.se/record/7f26796b-c60f-408e-ab52-9b8f2ed87b9d ; https://portal.research.lu.se/ws/files/11791591/thesis.pdf

► This thesis consists of five papers within the design and analysis of efficient *algorithms*.In the first paper, we consider the problem of computing all-pairs shortest…
(more)

Subjects/Keywords: Computer Science; Discrete Mathematics; Algorithms; Approximation algorithms; Graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

SLEDNEU, D. (2016). Studies in Efficient Discrete Algorithms. (Doctoral Dissertation). University of Lund. Retrieved from https://lup.lub.lu.se/record/7f26796b-c60f-408e-ab52-9b8f2ed87b9d ; https://portal.research.lu.se/ws/files/11791591/thesis.pdf

Chicago Manual of Style (16^{th} Edition):

SLEDNEU, DZMITRY. “Studies in Efficient Discrete Algorithms.” 2016. Doctoral Dissertation, University of Lund. Accessed April 17, 2021. https://lup.lub.lu.se/record/7f26796b-c60f-408e-ab52-9b8f2ed87b9d ; https://portal.research.lu.se/ws/files/11791591/thesis.pdf.

MLA Handbook (7^{th} Edition):

SLEDNEU, DZMITRY. “Studies in Efficient Discrete Algorithms.” 2016. Web. 17 Apr 2021.

Vancouver:

SLEDNEU D. Studies in Efficient Discrete Algorithms. [Internet] [Doctoral dissertation]. University of Lund; 2016. [cited 2021 Apr 17]. Available from: https://lup.lub.lu.se/record/7f26796b-c60f-408e-ab52-9b8f2ed87b9d ; https://portal.research.lu.se/ws/files/11791591/thesis.pdf.

Council of Science Editors:

SLEDNEU D. Studies in Efficient Discrete Algorithms. [Doctoral Dissertation]. University of Lund; 2016. Available from: https://lup.lub.lu.se/record/7f26796b-c60f-408e-ab52-9b8f2ed87b9d ; https://portal.research.lu.se/ws/files/11791591/thesis.pdf

27.
Lammersen, Christiane.
* Approximation* Techniques for
Facility Location and Their Applications in Metric
Embeddings.

Degree: 2010, Technische Universität Dortmund

URL: http://hdl.handle.net/2003/27597

► This thesis addresses the development of geometric *approximation* *algorithms* for huge datasets and is subdivided into two parts. The first part deals with *algorithms* for…
(more)

Subjects/Keywords: approximation algorithms; clustering; distributed algorithms; embedding; facility location; kinetic data structures; streaming algorithms; 004

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lammersen, C. (2010). Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/27597

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Lammersen, Christiane. “Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.” 2010. Thesis, Technische Universität Dortmund. Accessed April 17, 2021. http://hdl.handle.net/2003/27597.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lammersen, Christiane. “Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.” 2010. Web. 17 Apr 2021.

Vancouver:

Lammersen C. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. [Internet] [Thesis]. Technische Universität Dortmund; 2010. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/2003/27597.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lammersen C. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. [Thesis]. Technische Universität Dortmund; 2010. Available from: http://hdl.handle.net/2003/27597

Not specified: Masters Thesis or Doctoral Dissertation

28.
Lammersen, Christiane.
* Approximation* Techniques for Facility Location and Their Applications in Metric Embeddings.

Degree: 2011, Technische Universität Dortmund

URL: http://dx.doi.org/10.17877/DE290R-8506

► This thesis addresses the development of geometric *approximation* *algorithms* for huge datasets and is subdivided into two parts. The first part deals with *algorithms* for…
(more)

Subjects/Keywords: facility location; clustering; embedding; approximation algorithms; streaming algorithms; distributed algorithms; kinetic data structures; 004

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lammersen, C. (2011). Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-8506

Chicago Manual of Style (16^{th} Edition):

Lammersen, Christiane. “Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.” 2011. Doctoral Dissertation, Technische Universität Dortmund. Accessed April 17, 2021. http://dx.doi.org/10.17877/DE290R-8506.

MLA Handbook (7^{th} Edition):

Lammersen, Christiane. “Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.” 2011. Web. 17 Apr 2021.

Vancouver:

Lammersen C. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2011. [cited 2021 Apr 17]. Available from: http://dx.doi.org/10.17877/DE290R-8506.

Council of Science Editors:

Lammersen C. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. [Doctoral Dissertation]. Technische Universität Dortmund; 2011. Available from: http://dx.doi.org/10.17877/DE290R-8506

Columbia University

29. Shadravan, Mohammad. Submodular Secretary Problem with Shortlists under General Constraints.

Degree: 2020, Columbia University

URL: https://doi.org/10.7916/d8-cvbj-6c48

► In submodular k-secretary problem, the goal is to select k items in a randomly ordered input so as to maximize the expected value of a…
(more)

Subjects/Keywords: Operations research; Computer science; Online algorithms; Approximation algorithms; Algorithms; Secretary problem (Probability theory); Submodular functions

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shadravan, M. (2020). Submodular Secretary Problem with Shortlists under General Constraints. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/d8-cvbj-6c48

Chicago Manual of Style (16^{th} Edition):

Shadravan, Mohammad. “Submodular Secretary Problem with Shortlists under General Constraints.” 2020. Doctoral Dissertation, Columbia University. Accessed April 17, 2021. https://doi.org/10.7916/d8-cvbj-6c48.

MLA Handbook (7^{th} Edition):

Shadravan, Mohammad. “Submodular Secretary Problem with Shortlists under General Constraints.” 2020. Web. 17 Apr 2021.

Vancouver:

Shadravan M. Submodular Secretary Problem with Shortlists under General Constraints. [Internet] [Doctoral dissertation]. Columbia University; 2020. [cited 2021 Apr 17]. Available from: https://doi.org/10.7916/d8-cvbj-6c48.

Council of Science Editors:

Shadravan M. Submodular Secretary Problem with Shortlists under General Constraints. [Doctoral Dissertation]. Columbia University; 2020. Available from: https://doi.org/10.7916/d8-cvbj-6c48

30. Vu, Khac Ky. Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension.

Degree: Docteur es, Informatique, 2016, Université Paris-Saclay (ComUE)

URL: http://www.theses.fr/2016SACLX031

► À l'ère de la numérisation, les données devient pas cher et facile à obtenir. Cela se traduit par de nombreux nouveaux problèmes d'optimisation avec de…
(more)

Subjects/Keywords: Réduction de dimension; Approximation; Optimisation; Algorithmes randomisés; Dimension reduction; Approximation; Optimization; Randomized algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vu, K. K. (2016). Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2016SACLX031

Chicago Manual of Style (16^{th} Edition):

Vu, Khac Ky. “Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension.” 2016. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed April 17, 2021. http://www.theses.fr/2016SACLX031.

MLA Handbook (7^{th} Edition):

Vu, Khac Ky. “Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension.” 2016. Web. 17 Apr 2021.

Vancouver:

Vu KK. Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2016. [cited 2021 Apr 17]. Available from: http://www.theses.fr/2016SACLX031.

Council of Science Editors:

Vu KK. Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2016. Available from: http://www.theses.fr/2016SACLX031