Affiliation history
Bibliometrics: publication history
SEARCH
ROLE
Author only
· All roles

AUTHOR'S COLLEAGUES
See all colleagues of this author

BOOKMARK & SHARE

 #resultstats2 { width:100%; padding: 10px; background-color:#ECE9D8; /*background:#9c9;*/ } #resultstats { width:100%; /*background-color:#ECE9D8;*/ font-size: 12px; /*background:#9c9;*/ } #resultstats a:link { text-decoration: none; } #resultstats div { padding-bottom: 5px; padding-top: 5px; } #resfound { background-color: #ece9d8; padding-left:5px } #searchtools { display:inline; float:right; padding-right: 10px; } #refinements { padding-top: 5px; } #refinements table { margin-left: 10px; } #refinements tr { vertical-align:top; } #refinements span { font-size: 12px; } .rectots { font-size:12px; } .problem { font-size:12px; color: red; } div.problem { height: 400px; } #results { /* float:right; */ /* width:80%; */ color: #000000; font-family: Verdana,Arial,Helvetica,sans-serif; font-size: 12px; padding-top: 10px; /*background:#9c9;*/ } #aggs { float:left; width:20%; font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; } #pagelogic { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #pagerange { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:left; padding-bottom: 10px; } #resultmenu { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #resultmenu label { margin-right: 0px; vertical-align:bottom; } #resultmenu input { margin-right: 0px; vertical-align:bottom; } #resultmenu select { margin-right: 0px; background-color: #aff; border: 0; border-radius: 0; font-size: 12px; } #resultmenu option { font-size: 12px; background-color: white; } .aggHead { font-weight: bold; padding-bottom: 0; padding-top: 10px; } #aggs ul{ list-style-type: none; margin-top: 0.25em; padding-left: 0; font-size: 1em; } #upcevents li{ padding-bottom: 1.25em; } #upcevents div{ margin-top: 25px; } a.showhide:link { text-decoration: none; } #results .numbering{ font-size: 12px; font-weight:bold; width:30px; float:left; text-align: right; padding-top: 2px; } #results .details{ font-size: 12px; width:92%; float:right; padding-bottom: 20px; } #results .title{ font-size: 14px; padding-bottom:5px; } #results .authors{ font-size: 12px; padding-bottom:5px; } #results .source{ font-size: 12px; padding-bottom:5px; } #results .publisher{ font-size: 12px; padding-bottom:5px; } #results .metrics{ font-size: 12px; padding-bottom:5px; } #results .metricsCol1{ float: left; display:inline; padding-bottom:5px; } #results .metricsCol2{ float: right; display: inline; width: 590px; padding-bottom:5px; } #results .ft{ font-size: 12px; padding-bottom:5px; } #results .abstract{ font-size: 12px; padding-bottom:5px; } #results .kw{ font-size: 12px; padding-bottom:5px; } #results .pubother{ font-size: 12px; padding-bottom:5px; } .izers { margin-top: 10px; margin-bottom:10px; } .highlights em{ background-color: #FFFF00; font-style: normal; } .publicationDate { background-color: #aff; } .citedCount { } .download6Weeks { } .download12Months { } .downloadAll { } 13 results found Export Results: bibtex | endnote | acmref | csv Result 1 – 13 of 13 Sort by: relevance publication date citation count downloads (6 Weeks) downloads (12 months) downloads (overall) 1 January 2018 SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 6,   Downloads (12 Months): 6,   Downloads (Overall): 6 Full text available: PDF Clustering problems are well-studied in a variety of fields such as data science, operations research, and computer science. Such problems include variants of centre location problems, k -median, and k -means to name a few. In some cases, not all data points need to be clustered; some may be discarded ... 2 May 2016 Algorithmica: Volume 75 Issue 1, May 2016 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 In this paper, we consider the Unsplittable (hard) Capacitated Facility Location Problem (UCFLP) with uniform capacities and present new approximation algorithms for it. This problem is a generalization of the classical facility location problem where each facility can serve at most u units of demand and each client must be ... Keywords: Capacitated facility location, Hard capacities, Approximation algorithms 3 February 2016 Journal of Combinatorial Optimization: Volume 31 Issue 2, February 2016 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 In this paper we give improved approximation algorithms for some network design problems. In the bounded-diameter or shallow-light $$k$$k-Steiner tree problem (SL$$k$$kST), we are given an undirected graph $$G=(V,E)$$G=(V,E) with terminals $$T\subseteq V$$T⊆V containing a root $$r\in T$$r�T, a cost function $$c:E\rightarrow \mathbb {R}^+$$c:E�R+, a length function $$\ell :E\rightarrow \mathbb ... Keywords:$$k$$k-edge connected, Approximation algorithms, Steiner tree, Combinatorial optimization, Network design 4 September 2015 Algorithmica: Volume 73 Issue 1, September 2015 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 Given a metric$$(V,d)$$(V,d) and an integer$$k$$k, we consider the problem of partitioning the points of$$V$$V into at most$$kk clusters so as to minimize the sum of radii or the sum of diameters of these clusters. The former problem is called the minimum sum of radii (MSR) ... Keywords: Euclidean metric, Minimum sum radii and diameters, Clustering 5 January 2014 ACM Transactions on Algorithms (TALG): Volume 10 Issue 1, January 2014 Publisher: ACM Bibliometrics: Citation Count: 1 Downloads (6 Weeks): 0,   Downloads (12 Months): 14,   Downloads (Overall): 158 Full text available: PDF We consider the unsplittable flow problem on a line. In this problem, we are given a set of n tasks, each specified by a start time s i , an end time t i , a demand d i > 0, and a profit p i > 0. A task, ... Keywords: Approximation algorithms, scheduling, unsplittable flow, resource allocation problem 6 February 2013 Algorithmica: Volume 65 Issue 2, February 2013 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 We study two-stage robust variants of combinatorial optimization problems on undirected graphs, like Steiner tree, Steiner forest, and uncapacitated facility location. Robust optimization problems, previously studied by Dhamdhere et al. (Proc. of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp. 367---378, 2005), Golovin et al. (Proc. of ... Keywords: Robust facility location, Robust network design, Robust Steiner forest, Robust Steiner tree, Approximation algorithms, Hardness of approximation 7 July 2012 SWAT'12: Proceedings of the 13th Scandinavian conference on Algorithm Theory Publisher: Springer-Verlag Bibliometrics: Citation Count: 0 Given a metric ( V , d ) and an integer k , we consider the problem of covering the points of V with at most k clusters so as to minimize the sum of radii or the sum of diameters of these clusters. The former problem is called the ... Keywords: clustering, minimum sum radii and diameters, Euclidean 8 July 2012 SWAT'12: Proceedings of the 13th Scandinavian conference on Algorithm Theory Publisher: Springer-Verlag Bibliometrics: Citation Count: 1 In this paper, we consider the Unsplittable (hard) Capacitated Facility Location Problem (UCFLP) with uniform capacities and present some new approximation algorithms for it. This problem is a generalization of the classical facility location problem where each facility can serve at most u units of demand and each client must ... Keywords: Euclidean metrics, approximation algorithms, unsplittable capacitated facility location problem 9 January 2010 SIAM Journal on Computing: Volume 39 Issue 5, January 2010 Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 12 Buy-at-bulk network design problems arise in settings where the costs for purchasing or installing equipment exhibit economies of scale. The objective is to build a network of cheapest cost to support a given multicommodity flow demand between node pairs. We present approximation algorithms for buy-at-bulk network design problems with costs ... Keywords: concave cost, network design, network flow, approximation algorithm, economies of scale, nonuniform buy-at-bulk 10 January 2010 SIAM Journal on Computing: Volume 39 Issue 5, January 2010 Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 0 Buy-at-bulk network design problems arise in settings where the costs for purchasing or installing equipment exhibit economies of scale. The objective is to build a network of cheapest cost to support a given multicommodity flow demand between node pairs. We present approximation algorithms for buy-at-bulk network design problems with costs ... Keywords: network flow, approximation algorithm, economies of scale, nonuniform buy-at-bulk, concave cost, network design 11 January 2009 Algorithmica: Volume 53 Issue 1, January 2009 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 We study two related network design problems with two cost functions. In the buy-at-bulk k-Steiner tree problem we are given a graph G(V,E) with a set of terminals T⊆V including a particular vertex s called the root, and an integer k≤|T|. There are two cost functions on the edges of ... 12 August 2006 APPROX'06/RANDOM'06: Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation Publisher: Springer-Verlag Bibliometrics: Citation Count: 7 We study two related network design problems with two cost functions. In the buy-at-bulk k -Steiner tree problem we are given a graph G ( V , E ) with a set of terminals T ⊆ V including a particular vertex s called the root, and an integer k ≤| ... 13 April 2006 Graphs and Combinatorics: Volume 22 Issue 1, April 2006 Publisher: Springer-Verlag Bibliometrics: Citation Count: 1 Given a planar graph G , what is the largest subset of vertices of G that induces a forest? Albertson and Berman [2] conjectured that every planar graph has an induced subgraph on at least half of the vertices that is a forest. For bipartite planar graphs, Akiyama and Wanatabe ...