User singhsumit

singhsumit

Member for 11 years, 1 month
Last seen more than 5 years ago

9 Questions

Score Activity Newest Views

9 votes

1 answer

318 views

Bounding the number of edges between star graphs such that graph is planar

asked Apr 4, 2011 at 10:34

7 votes

0 answers

553 views

Difference between Primal Dual Algorithm for Proper and Uncrossable Functions

reference-request graph-algorithms approximation-algorithms primal-dual

asked Jul 18, 2011 at 11:20

6 votes

1 answer

662 views

Is there a example of Iterative Rounding in Approximation Algorithms for vertex weighted Graphs?

graph-algorithms approximation-algorithms linear-programming iterated-rounding

asked Jan 24, 2012 at 5:59

5 votes

0 answers

76 views

A question regarding Improved Algorithm for Degree Bounded Survivable Network Design Problem

approximation-algorithms iterated-rounding

asked Jul 11, 2011 at 0:07

5 votes

2 answers

1k views

Number of edges in $K_4$-free graphs

graph-theory co.combinatorics upper-bounds

asked Jun 8, 2011 at 11:14

4 votes

1 answer

281 views

3 colorable graphs

ds.algorithms graph-algorithms approximation-algorithms graph-colouring

asked Jun 11, 2011 at 13:57

3 votes

1 answer

262 views

Standard/Formal name for the graph

reference-request graph-theory co.combinatorics terminology

asked Jul 12, 2011 at 16:16

3 votes

1 answer

1k views

Max-cut via linear programming or sdp

ds.algorithms approximation-algorithms linear-programming max-cut integrality-gap

asked Jun 7, 2011 at 19:12

1 vote

1 answer

237 views

Weighted Metric Graph: ratio of sum of wts of edges to the wt of MST

graph-theory co.combinatorics graph-algorithms metrics

asked Apr 15, 2011 at 19:52

Stack Exchange Network

current community

your communities

more stack exchange communities

9 Questions

Bounding the number of edges between star graphs such that graph is planar

Difference between Primal Dual Algorithm for Proper and Uncrossable Functions

Is there a example of Iterative Rounding in Approximation Algorithms for vertex weighted Graphs?

A question regarding Improved Algorithm for Degree Bounded Survivable Network Design Problem

Number of edges in $K_4$-free graphs

3 colorable graphs

Standard/Formal name for the graph

Max-cut via linear programming or sdp

Weighted Metric Graph: ratio of sum of wts of edges to the wt of MST