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:(Approximation Algorithms). Showing records 1 – 30 of 331 total matches.

[1] [2] [3] [4] [5] … [12]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

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

Degree: PhD, Computer Science, 2011, Brown University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Das A. Approximation Schemes for Euclidean Vehicle Routing Problems. [Internet] [Doctoral dissertation]. Brown University; 2011. [cited 2020 Apr 03]. 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/


Texas A&M University

2. Li, Xiafeng. On Discrete Hyperbox Packing.

Degree: 2010, Texas A&M University

 Bin packing is a very important and popular research area in the computer science field. Past work showed many good and real-world packing algorithms. How-… (more)

Subjects/Keywords: bin packing; approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, X. (2010). On Discrete Hyperbox Packing. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186

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):

Li, Xiafeng. “On Discrete Hyperbox Packing.” 2010. Thesis, Texas A&M University. Accessed April 03, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186.

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

MLA Handbook (7th Edition):

Li, Xiafeng. “On Discrete Hyperbox Packing.” 2010. Web. 03 Apr 2020.

Vancouver:

Li X. On Discrete Hyperbox Packing. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186.

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

Council of Science Editors:

Li X. On Discrete Hyperbox Packing. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186

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


University of Victoria

3. 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

This file was last viewed in Microsoft Edge.

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

Subjects/Keywords: Game theory; Approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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):

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 03, 2020. http://digital.library.wisc.edu/1793/78968.

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

MLA Handbook (7th Edition):

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

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 2020 Apr 03]. Available from: http://digital.library.wisc.edu/1793/78968.

Note: this citation may be lacking information needed for this citation format:
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

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


Cornell University

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

Degree: 2007, Cornell University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

Svitkina, Zoya. “Approximation algorithms for new graph partitioning and facility location problems .” 2007. Thesis, Cornell University. Accessed April 03, 2020. 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 (7th Edition):

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

Vancouver:

Svitkina Z. Approximation algorithms for new graph partitioning and facility location problems . [Internet] [Thesis]. Cornell University; 2007. [cited 2020 Apr 03]. 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

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


Cornell University

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

Degree: 2012, Cornell University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

Council of Science Editors:

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

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


University of Waterloo

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

Degree: 2012, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


Princeton University

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

Degree: PhD, 2017, Princeton University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Naamad, Yonatan. “Hardness from Densest Subgraph Conjectures .” 2017. Web. 03 Apr 2020.

Vancouver:

Naamad Y. Hardness from Densest Subgraph Conjectures . [Internet] [Doctoral dissertation]. Princeton University; 2017. [cited 2020 Apr 03]. 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


Rutgers University

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

Degree: PhD, Mathematics, 2016, Rutgers University

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Apr 03]. 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Liu L. Trading quality for resource consumption through approximation management. [Internet] [Doctoral dissertation]. Rutgers University; 2020. [cited 2020 Apr 03]. 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: PhD, Computer Science and Engineering, 2015, Penn State University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Doctoral Dissertation, Penn State University. Accessed April 03, 2020. https://etda.libraries.psu.edu/catalog/27153.

MLA Handbook (7th Edition):

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Web. 03 Apr 2020.

Vancouver:

Dixit K. Robust Models For Property Testing. [Internet] [Doctoral dissertation]. Penn State University; 2015. [cited 2020 Apr 03]. Available from: https://etda.libraries.psu.edu/catalog/27153.

Council of Science Editors:

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

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

Degree: 2007, Technische Universität Dortmund

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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):

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

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

MLA Handbook (7th Edition):

Martens, Maren. “path-constrained network flows.” 2007. Web. 03 Apr 2020.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


University of Hong Kong

13. 姜少峰; Jiang, Shaofeng. Approximation schemes for network design problems in doubling metrics.

Degree: PhD, 2017, University of Hong Kong

Network design problems are important subjects in the study of approximation algorithms. The key challenge of network design problems is to find light networks with… (more)

Subjects/Keywords: Computer networks - Design and construction; Approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

姜少峰; Jiang, S. (2017). Approximation schemes for network design problems in doubling metrics. (Doctoral Dissertation). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/249912

Chicago Manual of Style (16th Edition):

姜少峰; Jiang, Shaofeng. “Approximation schemes for network design problems in doubling metrics.” 2017. Doctoral Dissertation, University of Hong Kong. Accessed April 03, 2020. http://hdl.handle.net/10722/249912.

MLA Handbook (7th Edition):

姜少峰; Jiang, Shaofeng. “Approximation schemes for network design problems in doubling metrics.” 2017. Web. 03 Apr 2020.

Vancouver:

姜少峰; Jiang S. Approximation schemes for network design problems in doubling metrics. [Internet] [Doctoral dissertation]. University of Hong Kong; 2017. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/10722/249912.

Council of Science Editors:

姜少峰; Jiang S. Approximation schemes for network design problems in doubling metrics. [Doctoral Dissertation]. University of Hong Kong; 2017. Available from: http://hdl.handle.net/10722/249912


Columbia University

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

Degree: 2016, Columbia University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Qiu Z. Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling. [Internet] [Doctoral dissertation]. Columbia University; 2016. [cited 2020 Apr 03]. 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


Cornell University

15. Cheung, Sin Shuen. Online And Offline Facility Location And Network Design .

Degree: 2016, Cornell University

 We study a few online and offline facility location and network design problems, including an offline facility location model with submodular opening costs, an online… (more)

Subjects/Keywords: Approximation Algorithms; Network Design; Facility Location

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheung, S. S. (2016). Online And Offline Facility Location And Network Design . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/43698

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):

Cheung, Sin Shuen. “Online And Offline Facility Location And Network Design .” 2016. Thesis, Cornell University. Accessed April 03, 2020. http://hdl.handle.net/1813/43698.

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

MLA Handbook (7th Edition):

Cheung, Sin Shuen. “Online And Offline Facility Location And Network Design .” 2016. Web. 03 Apr 2020.

Vancouver:

Cheung SS. Online And Offline Facility Location And Network Design . [Internet] [Thesis]. Cornell University; 2016. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/1813/43698.

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

Council of Science Editors:

Cheung SS. Online And Offline Facility Location And Network Design . [Thesis]. Cornell University; 2016. Available from: http://hdl.handle.net/1813/43698

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


University of Waterloo

16. Pritchard, David. Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization.

Degree: 2010, University of Waterloo

 We study techniques, approximation algorithms, structural properties and lower bounds related to applications of linear programs in combinatorial optimization. The following "Steiner tree problem" is… (more)

Subjects/Keywords: algorithms; linear programs; graphs; optimization; approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pritchard, D. (2010). Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4898

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):

Pritchard, David. “Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization.” 2010. Thesis, University of Waterloo. Accessed April 03, 2020. http://hdl.handle.net/10012/4898.

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

MLA Handbook (7th Edition):

Pritchard, David. “Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization.” 2010. Web. 03 Apr 2020.

Vancouver:

Pritchard D. Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Apr 03]. Available from: http://hdl.handle.net/10012/4898.

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

Council of Science Editors:

Pritchard D. Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/4898

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

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

Degree: PhD, 2013, Princeton University

 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

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):

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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Sachdeva S. New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . [Internet] [Doctoral dissertation]. Princeton University; 2013. [cited 2020 Apr 03]. 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 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 03, 2020. https://era.library.ualberta.ca/files/cbr86b369q.

MLA Handbook (7th 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. 03 Apr 2020.

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 2020 Apr 03]. 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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):

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

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

MLA Handbook (7th Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Web. 03 Apr 2020.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


Penn State University

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

Degree: MS, Computer Science and Engineering, 2014, Penn State University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Internet] [Masters thesis]. Penn State University; 2014. [cited 2020 Apr 03]. Available from: https://etda.libraries.psu.edu/catalog/22793.

Council of Science Editors:

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


Virginia Tech

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

Degree: PhD, Electrical and Computer Engineering, 2013, Virginia Tech

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Pei G. Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model. [Internet] [Doctoral dissertation]. Virginia Tech; 2013. [cited 2020 Apr 03]. 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


Cornell University

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

Degree: 2012, Cornell University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

Council of Science Editors:

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

Note: this citation may be lacking information needed for this citation format:
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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Kanade GN. Combinatorial optimization problems in geometric settings. [Internet] [Doctoral dissertation]. University of Iowa; 2011. [cited 2020 Apr 03]. 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 Lund

24. SLEDNEU, DZMITRY. Studies in Efficient Discrete Algorithms.

Degree: 2016, University of Lund

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

SLEDNEU, DZMITRY. “Studies in Efficient Discrete Algorithms.” 2016. Web. 03 Apr 2020.

Vancouver:

SLEDNEU D. Studies in Efficient Discrete Algorithms. [Internet] [Doctoral dissertation]. University of Lund; 2016. [cited 2020 Apr 03]. 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


University of Illinois – Urbana-Champaign

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Kumar, Nirman. “In search of better proximity.” 2014. Web. 03 Apr 2020.

Vancouver:

Kumar N. In search of better proximity. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Apr 03]. 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

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

Degree: 2010, Technische Universität Dortmund

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


Columbia University

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

Degree: 2020, Columbia University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Shadravan M. Submodular Secretary Problem with Shortlists under General Constraints. [Internet] [Doctoral dissertation]. Columbia University; 2020. [cited 2020 Apr 03]. 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

28. 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)

 À 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 03, 2020. http://www.theses.fr/2016SACLX031.

MLA Handbook (7th Edition):

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

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 2020 Apr 03]. 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

29. Pham, Hong Phong. Studies on Optimal Colorful Structures in Vertex-Colored Graphs : Études sur les structures colorées optimales dans les graphes sommet-colorés.

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

 Dans cette thèse, nous étudions des problèmes différents de coloration maximale dans les graphes sommet-colorés. Nous nous concentrons sur la recherche des structures avec le… (more)

Subjects/Keywords: Théorie des graphes; Algorithmes; Approximation; FPT; Combinatoire; Graph theory; Algorithms; Approximation; FPT; Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pham, H. P. (2018). Studies on Optimal Colorful Structures in Vertex-Colored Graphs : Études sur les structures colorées optimales dans les graphes sommet-colorés. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2018SACLS528

Chicago Manual of Style (16th Edition):

Pham, Hong Phong. “Studies on Optimal Colorful Structures in Vertex-Colored Graphs : Études sur les structures colorées optimales dans les graphes sommet-colorés.” 2018. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed April 03, 2020. http://www.theses.fr/2018SACLS528.

MLA Handbook (7th Edition):

Pham, Hong Phong. “Studies on Optimal Colorful Structures in Vertex-Colored Graphs : Études sur les structures colorées optimales dans les graphes sommet-colorés.” 2018. Web. 03 Apr 2020.

Vancouver:

Pham HP. Studies on Optimal Colorful Structures in Vertex-Colored Graphs : Études sur les structures colorées optimales dans les graphes sommet-colorés. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2018. [cited 2020 Apr 03]. Available from: http://www.theses.fr/2018SACLS528.

Council of Science Editors:

Pham HP. Studies on Optimal Colorful Structures in Vertex-Colored Graphs : Études sur les structures colorées optimales dans les graphes sommet-colorés. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2018. Available from: http://www.theses.fr/2018SACLS528


University of Southern California

30. Das, Abhimanyu. Subset selection algorithms for prediction.

Degree: PhD, Computer Science, 2011, University of Southern California

 In this dissertation, we study the subset selection problem for prediction. It deals with choosing the “best” or “most informative” k-subset from a large set… (more)

Subjects/Keywords: approximation algorithms; machine learning; regression; feature selection; sparse approximation; compressed sensing; submodularity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Das, A. (2011). Subset selection algorithms for prediction. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644551/rec/6197

Chicago Manual of Style (16th Edition):

Das, Abhimanyu. “Subset selection algorithms for prediction.” 2011. Doctoral Dissertation, University of Southern California. Accessed April 03, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644551/rec/6197.

MLA Handbook (7th Edition):

Das, Abhimanyu. “Subset selection algorithms for prediction.” 2011. Web. 03 Apr 2020.

Vancouver:

Das A. Subset selection algorithms for prediction. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2020 Apr 03]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644551/rec/6197.

Council of Science Editors:

Das A. Subset selection algorithms for prediction. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644551/rec/6197

[1] [2] [3] [4] [5] … [12]

.