forked from fast-algos/graphs-matrices-optimization
-
Notifications
You must be signed in to change notification settings - Fork 0
/
papers.bib
1680 lines (1484 loc) · 53.6 KB
/
papers.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
@string{proc16 = "Proc.\ 16th "}
@string{stacs = "Symposium on Theoretical Aspects of Computer
Science"}
@string{proc43 = "Proc.\ 43rd "}
@string{stoc = "Annual ACM Symposium on the Theory of Computing"}
@string(ICALP={ICALP})
@string(FOCS={FOCS})
@inproceedings{Chuzhoy,
author = {Chuzhoy, Julia},
title = {On vertex sparsifiers with Steiner nodes},
series = {STOC},
year = {2012},
isbn = {978-1-4503-1245-5},
pages = {673--688},
numpages = {16},
url = {http://doi.acm.org/10.1145/2213977.2214039},
doi = {10.1145/2213977.2214039},
acmid = {2214039},
keywords = {vertex sparsifiers},
}
@inproceedings{MM,
author = {Makarychev, Konstantin and Makarychev, Yury},
title = {Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability},
series = {FOCS},
year = {2010},
isbn = {978-0-7695-4244-7},
pages = {255--264},
numpages = {10},
url = {http://dx.doi.org/10.1109/FOCS.2010.31},
doi = {10.1109/FOCS.2010.31},
acmid = {1918390},
}
@article{KRTV,
author = {Arindam Khan and
Prasad Raghavendra and
Prasad Tetali and
L{\'a}szl{\'o} A. V{\'e}gh},
title = {On Mimicking Networks Representing Minimum Terminal Cuts},
journal = {CoRR},
volume = {abs/1207.6371},
year = 2012,
ee = {http://arxiv.org/abs/1207.6371},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{S,
author = {Endre Szemer\'{e}di},
title = {On sets of integers containing no k elements in arithmetic progression},
journal = {Acta Arithmetica},
volume = {27},
year = {1975}
}
@article{RS,
author = {I. Z. Ruzsa and E. Szemer\'{e}di},
title = {Triple systems with no six points carrying three triangles},
journal = {Coll. Math. Soc. J. Bolyai},
volume = {18},
year = {1978}
}
@article{Fox,
author = {Jacob Fox},
title = {RSA new proof of the graph removal lemma},
journal = {Annals of Mathematics},
volume = {174},
year = {2011}
}
@article{Alon,
author = {Alon, Noga},
title = {Testing subgraphs in large graphs},
journal = {Random Struct. Algorithms},
issue_date = {October 2002},
volume = {21},
number = {3-4},
year = {2002},
issn = {1042-9832},
pages = {359--370},
numpages = {12},
url = {http://dx.doi.org/10.1002/rsa.10056},
doi = {10.1002/rsa.10056},
acmid = {772624},
}
@inproceedings{BN,
author = {Bhattacharyya, Arnab and Xie, Ning},
title = {Lower bounds for testing triangle-freeness in Boolean functions},
series = {SODA},
year = {2010},
isbn = {978-0-898716-98-6},
pages = {87--98},
numpages = {12},
url = {http://dl.acm.org/citation.cfm?id=1873601.1873610},
acmid = {1873610},
}
@article{AroraLN08,
Author = {Arora, Sanjeev and Lee, James R. and Naor, Assaf},
Date-Added = {2010-12-21 20:15:54 -0800},
Date-Modified = {2010-12-21 20:16:14 -0800},
Journal = {J. Amer. Math. Soc.},
Pages = {1-21},
Title = {Euclidean distortion and the sparsest cut},
Volume = {21},
Year = {2008},
}
@article{ARV,
author = {Arora, Sanjeev and Rao, Satish and Vazirani, Umesh},
title = {Expander flows, geometric embeddings and graph partitioning},
journal = {J. ACM},
issue_date = {April 2009},
volume = {56},
number = {2},
year = {2009},
issn = {0004-5411},
pages = {5:1--5:37},
articleno = {5},
numpages = {37},
url = {http://doi.acm.org/10.1145/1502793.1502794},
doi = {10.1145/1502793.1502794},
acmid = {1502794},
keywords = {Graph partitioning, expanders, expansion, graph separators, multicommodity flows, semidefinite programs},
}
@inproceedings{SpielmanT04,
author = {Spielman, Daniel A. and Teng, Shang-Hua},
title = {Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems},
series = {STOC},
year = {2004},
isbn = {1-58113-852-0},
pages = {81--90},
numpages = {10},
url = {http://doi.acm.org/10.1145/1007352.1007372},
doi = {10.1145/1007352.1007372},
acmid = {1007372},
keywords = {graph partitioning, graph sparsification, preconditioners},
}
@inproceedings{CheegerKN09,
Author = {Cheeger, Jeff and Kleiner, Bruce and Naor, Assaf},
series = {FOCS},
Date-Added = {2010-12-21 20:25:54 -0800},
Date-Modified = {2010-12-21 20:26:00 -0800},
Doi = {http://dx.doi.org/10.1109/FOCS.2009.47},
Isbn = {978-0-7695-3850-1},
Pages = {555--564},
Title = {A $(\log n)^{\Omega(1)}$ Integrality Gap for the Sparsest Cut SDP},
Year = {2009},
Bdsk-Url-1 = {http://dx.doi.org/10.1109/FOCS.2009.47}}
@article{Valiant,
author = {Valiant, Leslie G.},
doi = {10.1016/0304-3975(79)90044-6},
journal = tcs,
number = {2},
pages = {189--201},
title = {{The complexity of computing the permanent}},
url = {http://dx.doi.org/10.1016/0304-3975(79)90044-6},
volume = {8},
year = {1979}
}
@inproceedings{cai,
author = {{Jin-yi} Cai and
Aduri Pavan and
D. Sivakumar},
title = {On the Hardness of Permanent},
booktitle = proc16 # stacs,
year = {1999},
pages = {90-99},
ee = {http://dx.doi.org/10.1007/3-540-49116-3_8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{AA,
author = {Scott Aaronson and
Alex Arkhipov},
title = {The computational complexity of linear optics},
booktitle = proc43 # stoc,
year = {2011},
pages = {333-342},
ee = {http://doi.acm.org/10.1145/1993636.1993682},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@ARTICLE{DS,
author = {I. Dinur and S. Safra},
title = {On the Hardness of Approximating Minimum Vertex Cover},
journal = {Annals of Mathematics},
year = {2004},
volume = {162},
pages = {439-485}
}
@article{KR,
author = {S. Khot and
O. Regev},
title = {Vertex cover might be hard to approximate to within 2-epsilon},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {3},
year = {2008},
pages = {335-349}
}
@article{DGKR,
author = {I. Dinur and V. Guruswami and S. Khot and O. Regev},
title = {A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover},
journal = {SIAM J. Comput.},
volume = {34},
issue = {5},
year = {2005},
issn = {0097-5397},
pages = {1129--1146},
numpages = {18},
url = {http://portal.acm.org/citation.cfm?id=1068394.1068417},
doi = {10.1137/S0097539704443057},
acmid = {1068417},
keywords = {hardness of approximation, hypergraph vertex cover, long-code, multilayered outer verifier, probabilistically checkable proof},
}
@inproceedings{She,
author = {Jonah Sherman},
title = {Breaking the Multicommodity Flow Barrier for ${O}(\sqrt{\log n})$-Approximations
to Sparsest Cut},
series = {FOCS},
year = {2009},
ee = {http://arxiv.org/abs/0908.1379},
}
@inproceedings{AroraK07,
author = {Sanjeev Arora and
Satyen Kale},
title = {A combinatorial, primal-dual approach to semidefinite programs},
series = {STOC},
year = {2007},
pages = {227-236},
ee = {http://doi.acm.org/10.1145/1250790.1250823},
}
@inproceedings{GSaket,
author = {V. Guruswami and
R. Saket},
title = {On the Inapproximability of Vertex Cover on {\it k}-Partite
{\it k}-Uniform Hypergraphs},
booktitle = {ICALP},
year = {2010},
pages = {360-371}
}
@inproceedings{BK10,
author = {N. Bansal and
S. Khot},
title = {Inapproximability of Hypergraph Vertex Cover and Applications
to Scheduling Problems},
booktitle = ICALP,
year = {2010},
pages = {250-261}
}
@inproceedings{FJK,
author = {Frieze, Alan M. and Jerrum, Mark and Kannan, Ravi},
booktitle = {FOCS},
pages = {359-368},
title = {Learning Linear Transformations.},
year = 1996
}
@article{AMS,
author = {Amb\"{u}hl, Christoph and Mastrolilli, Monaldo and Svensson, Ola},
title = {Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut},
journal = {SIAM J. Comput.},
issue_date = {March 2011},
volume = {40},
number = {2},
year = {2011},
issn = {0097-5397},
pages = {567--596},
numpages = {30},
url = {http://dx.doi.org/10.1137/080729256},
doi = {10.1137/080729256},
acmid = {2078878},
keywords = {graph theory, hardness of approximation},
}
@article{Khot06,
author = {Khot, Subhash},
title = {Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique},
journal = {SIAM J. Comput.},
issue_date = {December 2006},
volume = {36},
number = {4},
year = {2006},
issn = {0097-5397},
pages = {1025--1071},
numpages = {47},
url = {http://dx.doi.org/10.1137/S0097539705447037},
doi = {10.1137/S0097539705447037},
acmid = {1328009},
keywords = {approximation algorithms, hardness of approximation, probabilistically checkable proofs (PCPs)},
}
@inproceedings{Khot02,
author = {Khot, Subhash},
title = {On the power of unique 2-prover 1-round games},
series = {STOC},
year = {2002},
isbn = {1-58113-495-9},
pages = {767--775},
numpages = {9},
url = {http://doi.acm.org/10.1145/509907.510017},
doi = {10.1145/509907.510017},
acmid = {510017},
}
@inproceedings{BRS,
author = {Barak, Boaz and Raghavendra, Prasad and Steurer, David},
title = {Rounding Semidefinite Programming Hierarchies via Global Correlation},
series = {FOCS},
year = {2011},
isbn = {978-0-7695-4571-4},
pages = {472--481},
numpages = {10},
url = {http://dx.doi.org/10.1109/FOCS.2011.95},
doi = {10.1109/FOCS.2011.95},
acmid = {2082889},
}
@inproceedings{GSinop,
author = {Guruswami, Venkatesan and Sinop, Ali Kemal},
title = {Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives},
series = {FOCS},
year = {2011},
isbn = {978-0-7695-4571-4},
pages = {482--491},
numpages = {10},
url = {http://dx.doi.org/10.1109/FOCS.2011.36},
doi = {10.1109/FOCS.2011.36},
acmid = {2082890},
keywords = {approximation algorithms, graph partitioning, unique games, semidefinite programming},
}
@inproceedings{BK09,
author = {N. Bansal and
S. Khot},
title = {Optimal Long Code Test with One Free Bit},
booktitle = FOCS,
year = {2009},
pages = {453-462}
}
@article{MQSSU,
author = {Mastrolilli, M. and Queyranne, M. and Schulz, A. S. and Svensson, O. and Uhan, N. A.},
title = {Minimizing the sum of weighted completion times in a concurrent open shop},
journal = {Oper. Res. Lett.},
issue_date = {September, 2010},
volume = {38},
number = {5},
year = {2010},
issn = {0167-6377},
pages = {390--395},
numpages = {6},
url = {http://dx.doi.org/10.1016/j.orl.2010.04.011},
doi = {10.1016/j.orl.2010.04.011},
acmid = {2284080},
keywords = {Approximation algorithm, Hardness of approximation, Integrality gap, Scheduling},
}
@inproceedings{Moitra,
author = {Moitra, Ankur},
title = {Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size},
series = {FOCS},
year = {2009},
isbn = {978-0-7695-3850-1},
pages = {3--12},
numpages = {10},
url = {http://dx.doi.org/10.1109/FOCS.2009.28},
doi = {10.1109/FOCS.2009.28},
acmid = {1748018},
keywords = {multicommodity flow, metric geometry, approximation algorithms},
}
@inproceedings{LM,
author = {Leighton, F. Thomson and Moitra, Ankur},
title = {Extensions and limits to vertex sparsification},
series = {STOC},
year = {2010},
isbn = {978-1-4503-0050-6},
pages = {47--56},
numpages = {10},
url = {http://doi.acm.org/10.1145/1806689.1806698},
doi = {10.1145/1806689.1806698},
acmid = {1806698},
keywords = {multicommodity flow, oblivious reductions},
}
@inproceedings{CLLM,
author = {Charikar, Moses and Leighton, Tom and Li, Shi and Moitra, Ankur},
title = {Vertex Sparsifiers and Abstract Rounding Algorithms},
series = {FOCS },
year = {2010},
isbn = {978-0-7695-4244-7},
pages = {265--274},
numpages = {10},
url = {http://dx.doi.org/10.1109/FOCS.2010.32},
doi = {10.1109/FOCS.2010.32},
acmid = {1918391},
keywords = {vertex sparsifier, approximation algorithms},
}
@inproceedings{EGK,
author = {Englert, Matthias and Gupta, Anupam and Krauthgamer, Robert and R\"{a}cke, Harald and Talgam-Cohen, Inbal and Talwar, Kunal},
title = {Vertex sparsifiers: new results from old techniques},
series = {APPROX/RANDOM},
year = {2010},
isbn = {3-642-15368-2, 978-3-642-15368-6},
pages = {152--165},
numpages = {14},
url = {http://dl.acm.org/citation.cfm?id=1886521.1886534},
acmid = {1886534},
}
@inproceedings{MM,
author = {Makarychev, Konstantin and Makarychev, Yury},
title = {Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability},
series = {FOCS},
year = {2010},
isbn = {978-0-7695-4244-7},
pages = {255--264},
numpages = {10},
url = {http://dx.doi.org/10.1109/FOCS.2010.31},
doi = {10.1109/FOCS.2010.31},
acmid = {1918390},
}
@inproceedings{ABS,
author = {Arora, Sanjeev and Barak, Boaz and Steurer, David},
title = {Subexponential Algorithms for Unique Games and Related Problems},
series = {FOCS},
year = {2010},
isbn = {978-0-7695-4244-7},
pages = {563--572},
numpages = {10},
url = {http://dx.doi.org/10.1109/FOCS.2010.59},
doi = {10.1109/FOCS.2010.59},
acmid = {1918331},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
keywords = {Approximation Algorithms, Unique Games, Subexponential Algorithms, Spectral Methods, Eigenvalues, Graph Decompositions, Constraint Satisfaction Problems},
}
@inproceedings{AP,
author = {Reid Andersen and
Yuval Peres},
title = {Finding sparse cuts locally using evolving sets},
series = {STOC},
year = {2009},
pages = {235-244},
ee = {http://doi.acm.org/10.1145/1536414.1536449},
}
@inproceedings{OV,
author = {Lorenzo Orecchia and
Nisheeth K. Vishnoi},
title = {Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time
Algorithm for Graph Partitioning and Decomposition},
booktitle = {SODA},
year = {2011},
pages = {532-545},
ee = {http://www.siam.org/proceedings/soda/2011/SODA11_042_orecchial.pdf},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{KannanN2012,
author = {Ravindran Kannan and Hariharan Narayanan},
title = {Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming},
journal = {Mathematics of Operations Research},
volume = {37},
number = {1},
pages = {1-20},
year = {2012},
URL = {http://dx.doi.org/10.1287/moor.1110.0519},
}
@article{Narayanan09,
author = {Hariharan Narayanan},
title = {Randomized Interior Point methods for Sampling and Optimization},
journal = {The Annals of Applies Probability},
volume = {To appear},
year = {2015},
}
@INPROCEEDINGS{ZhuGL03,
author = {Xiaojin Zhu and Zoubin Ghahramani and John Lafferty},
title = {Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions},
booktitle = {ICML},
year = {2003},
pages = {912--919},
publisher = {}
}
@article{Lovasz75,
title = {On minimax theorems of combinatorics},
author = {Laszlo Lov{\'a}sz},
journal = {Doctoral Thesis, Mathematiki Lapok},
volume = {26},
year = {1975},
pages = {209-264}
}
@inproceedings{CohenKMPPRX14,
author = {Cohen, Michael B. and Kyng, Rasmus and Miller, Gary L. and Pachocki, Jakub W. and Peng, Richard and Rao, Anup B. and Xu, Shen Chen},
title = {Solving SDD Linear Systems in Nearly $m \log^{\nfrac{1}{2}} n$ Time},
booktitle = {Proceedings of the 46th Annual ACM Symposium on Theory of Computing},
series = {STOC '14},
year = {2014},
isbn = {978-1-4503-2710-7},
pages = {343--352},
numpages = {10},
url = {http://doi.acm.org/10.1145/2591796.2591833},
doi = {10.1145/2591796.2591833},
acmid = {2591833},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {SDD linear systems, combinatorial preconditioning, random matrices, tree embeddings},
}
@article{SpielmanT14,
author = {Daniel A. Spielman and Shang-Hua Teng},
title = {Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems},
journal = {SIAM Journal on Matrix Analysis and Applications},
volume = {35},
number = {3},
pages = {835-885},
year = {2014},
}
@article{SachdevaV13,
author = {Sushant Sachdeva and
Nisheeth K. Vishnoi},
title = {Matrix Inversion Is As Easy As Exponentiation},
journal = {CoRR},
volume = {abs/1305.0526},
year = {2013},
url = {http://arxiv.org/abs/1305.0526},
}
@inproceedings{OrecchiaSV12,
author = {Orecchia, Lorenzo and Sachdeva, Sushant and Vishnoi, Nisheeth K.},
title = {Approximating the Exponential, the Lanczos Method and an $\tilde{O}(m)$-time Spectral Algorithm for Balanced Separator},
booktitle = {Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing},
series = {STOC '12},
year = {2012},
isbn = {978-1-4503-1245-5},
pages = {1141--1160},
numpages = {20},
url = {http://doi.acm.org/10.1145/2213977.2214080},
doi = {10.1145/2213977.2214080},
acmid = {2214080},
publisher = {ACM},
keywords = {balanced graph partitioning, lanczos method, matrix exponential, spectral algorithms, uniform approximation},
}
@article{AroraLS11,
author = {Arora, Sanjeev and
Lee, James R. and
Sachdeva, Sushant},
title = {A Reformulation of the Arora-Rao-Vazirani Structure Theorem},
journal = {CoRR},
volume = {abs/1102.1456},
year = {2011},
ee = {http://arxiv.org/abs/1102.1456},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@INPROCEEDINGS{SachdevaS13,
author={Sachdeva, Sushant and Saket, Rishi},
booktitle={Computational Complexity (CCC), 2013 IEEE Conference on},
title={Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover},
year={2013},
pages={219-229},
doi={10.1109/CCC.2013.30},
month={June},}
@incollection{SachdevaS11,
year={2011},
isbn={978-3-642-22934-3},
booktitle={Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
volume={6845},
series={Lecture Notes in Computer Science},
doi={10.1007/978-3-642-22935-0_28},
title={Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs},
url={http://dx.doi.org/10.1007/978-3-642-22935-0_28},
publisher={Springer Berlin Heidelberg},
author={Sachdeva, Sushant and Saket, Rishi},
pages={327-338},
}
@incollection{AroraBMS12,
year={2012},
isbn={978-3-642-32511-3},
booktitle={Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
volume={7408},
series={Lecture Notes in Computer Science},
doi={10.1007/978-3-642-32512-0_31},
title={Testing Permanent Oracles - Revisited},
url={http://dx.doi.org/10.1007/978-3-642-32512-0_31},
publisher={Springer Berlin Heidelberg},
author={Arora, Sanjeev and Bhattacharyya, Arnab and Manokaran, Rajsekar and Sachdeva, Sushant},
pages={362-373},
language={English}
}
@article{SachdevaT11,
author = {Sachdeva, Sushant and
Tulsiani, Madhur},
title = {Cuts in Cartesian Products of Graphs},
journal = {CoRR},
volume = {abs/1105.3383},
year = {2011},
ee = {http://arxiv.org/abs/1105.3383},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@incollection{AroraGMS12,
title = {Provable ICA with Unknown Gaussian Noise, with Implications for Gaussian Mixtures and Autoencoders},
author = {Sanjeev Arora and Ge, Rong and Moitra, Ankur and Sachdeva, Sushant},
booktitle = {Advances in Neural Information Processing Systems 25},
pages = {2375--2383},
year = {2012},
publisher = {Curran Associates, Inc.},
url = {http://papers.nips.cc/paper/4603-provable-ica-with-unknown-gaussian-noise-with-implications-for-gaussian-mixtures-and-autoencoders.pdf}
}
@article{SachdevaV14,
author = {Sachdeva, Sushant and Vishnoi, Nisheeth K.},
title = {Faster Algorithms via Approximation Theory},
journal = {Found. Trends Theor. Comput. Sci.},
issue_date = {March 2014},
volume = {9},
number = {2},
month = mar,
year = {2014},
issn = {1551-305X},
pages = {125--210},
numpages = {86},
url = {http://dx.doi.org/10.1561/0400000065},
doi = {10.1561/0400000065},
acmid = {2693055},
publisher = {Now Publishers Inc.},
address = {Hanover, MA, USA},
keywords = {Budget Optimization, E-commerce, Internet Advertising, Online Algorithms, Online Stochastic Optimization},
}
@unpublished{KyngRS15,
author = {Rasmus Kyng and
Anup Rao and
Sushant Sachdeva},
title = {Fast, Provable Algorithms for Isotonic Regression in all $\ell_p$-norms},
year = {2015},
note = {To appear at \emph{Advances in Neural Information Processing Systems (NIPS)}}
}
@proceedings{DBLP:conf/colt/2015,
title = {Proceedings of The 28th Conference on Learning Theory, {COLT} 2015,
Paris, France, 2015},
series = {{JMLR} Proceedings},
volume = 40,
publisher = {JMLR.org},
year = 2015,
url = {http://jmlr.org/proceedings/papers/v40/},
timestamp = {Mon, 06 Jul 2015 08:17:14 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/conf/colt/2015},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{KyngRSS15,
author = {Rasmus Kyng and
Anup Rao and
Sushant Sachdeva and
Daniel A. Spielman},
title = {Algorithms for Lipschitz Learning on Graphs},
booktitle = {Proceedings of The 28th Conference on Learning Theory, {COLT} 2015,
Paris, France, 2015},
pages = {1190--1223},
year = {2015},
crossref = {DBLP:conf/colt/2015},
url = {http://jmlr.org/proceedings/papers/v40/Kyng15.html},
timestamp = {Mon, 06 Jul 2015 08:31:46 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/conf/colt/KyngRSS15},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{AroraGMS15,
author = {Arora, Sanjeev and Ge, Rong and Moitra, Ankur and Sachdeva, Sushant},
title = {Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders},
journal = {Algorithmica},
issue_date = {May 2015},
volume = {72},
number = {1},
month = may,
year = {2015},
issn = {0178-4617},
pages = {215--236},
numpages = {22},
url = {http://dx.doi.org/10.1007/s00453-015-9972-2},
doi = {10.1007/s00453-015-9972-2},
acmid = {2756046},
publisher = {Springer-Verlag New York, Inc.},
address = {Secaucus, NJ, USA},
keywords = {Cumulants, Independent component analysis, Method of moments, Mixture models},
}
@article{GuruswamiSS15,
author = {Venkatesan Guruswami and Sushant Sachdeva and Rishi Saket},
title = {Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs},
journal = {SIAM Journal on Discrete Mathematics},
volume = {29},
number = {1},
pages = {36-58},
year = {2015},
}
@inproceedings{AroraGSS12,
author = {Arora, Sanjeev and Ge, Rong and Sachdeva, Sushant and Schoenebeck, Grant},
title = {Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach},
booktitle = {Proceedings of the 13th ACM Conference on Electronic Commerce},
series = {EC '12},
year = {2012},
isbn = {978-1-4503-1415-2},
pages = {37--54},
numpages = {18},
url = {http://doi.acm.org/10.1145/2229012.2229020},
doi = {10.1145/2229012.2229020},
acmid = {2229020},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {overlapping community detection, social network analysis},
}
@incollection{BhangaleKS15,
year={2015},
isbn={978-3-662-47671-0},
booktitle={Automata, Languages, and Programming},
volume={9134},
series={Lecture Notes in Computer Science},
doi={10.1007/978-3-662-47672-7_16},
title={Simultaneous Approximation of Constraint Satisfaction Problems},
url={http://dx.doi.org/10.1007/978-3-662-47672-7_16},
publisher={Springer Berlin Heidelberg},
author={Bhangale, Amey and Kopparty, Swastik and Sachdeva, Sushant},
pages={193-205},
language={English}
}
@article{SachdevaV15,
author = {Sushant Sachdeva and
Nisheeth K. Vishnoi},
title = {A Simple Analysis of the Dikin Walk},
journal = {CoRR},
volume = {abs/1508.01977},
year = {2015},
url = {http://arxiv.org/abs/1508.01977},
timestamp = {Tue, 01 Sep 2015 14:42:40 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/SachdevaV15},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@misc{LexGithub,
author = {Rasmus Kyng and
Anup Rao and
Sushant Sachdeva and
Daniel A. Spielman},
title = {{YINSlex: Code for Lipschitz learning}},
howpublished = "\url{https://github.com/danspielman/YINSlex}",
year = {2015},
}
@misc{IsotonicGitHub,
author = {Rasmus Kyng and
Anup Rao and
Sushant Sachdeva},
title = {{Code for Isotonic Regression on graphs}},
howpublished = "\url{https://github.com/sachdevasushant/Isotonic}",
year = {2015},
}
@article{MoharramiS11,
author = {Moharrami, Mohammad and Sachdeva, Sushant},
title = {Power of weak v/s strong triangle inequalities},
journal = {Manuscript},
year = {2011},
}
@article{HatamiST13,
author = {{Hatami}, Pooya and {Sachdeva}, Sushant and {Tulsiani}, Madhur},
title = "{An Arithmetic Analogue of Fox's Triangle Removal Argument}",
journal = {Online Journal of Analytic Combinatorics},
year = {2015},
volume = {Accepted pending minor revisions},
}
@misc{ClassNotes15,
author = {Various},
title = {{Lecture notes for \emph{An Algorithmist's Toolkit}}},
howpublished = "\url{https://www.cs.yale.edu/~sachdeva/spring15/cpsc665.html}",
year = {Spring 2015},
}
@inproceedings{KyngLPSS16,
author = {Kyng, Rasmus and Lee, Yin Tat and Peng, Richard and Sachdeva, Sushant and Spielman, Daniel A.},
title = {Sparsified Cholesky and Multigrid Solvers for Connection Laplacians},
booktitle = {Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing},
series = {STOC '16},
year = {2016},
isbn = {978-1-4503-4132-5},
pages = {842--850},
numpages = {9},
url = {http://doi.acm.org/10.1145/2897518.2897640},
doi = {10.1145/2897518.2897640},
acmid = {2897640},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Connection Laplacians, SDD linear systems, linear system solvers, parallel algorithms},
}
@ARTICLE{LoriotSBPC11,
author={Loriot, S. and Sachdeva, S. and Bastard, K. and Prevost, C. and Cazals, F.},
journal={Computational Biology and Bioinformatics, IEEE/ACM Transactions on},
title={On the Characterization and Selection of Diverse Conformational Ensembles with Applications to Flexible Docking},
year={2011},
volume={8},
number={2},
pages={487-498},
keywords={bioinformatics;greedy algorithms;molecular biophysics;molecular configurations;proteins;redundancy;Betti numbers;candidate conformers collection;diverse conformational ensembles;flexible docking;geometric diversity criterion;geometric optimization;greedy strategies;molecular surface area;molecular volume;protein complex;redundancy;Biochemistry;Biological processes;Biological system modeling;Computational modeling;Geometry;Nanobioscience;Proteins;Solid modeling;Spine;Thermodynamics;Flexibility;Van der Waals models;conformer selection;flexible docking;geometric optimization;molecular surface area (MSA).;Algorithms;Binding Sites;Computational Biology;Protein Conformation;Proteins},
doi={10.1109/TCBB.2009.59},
ISSN={1545-5963},
month={March},}
@INPROCEEDINGS{Madry13,
author={Madry, A.},
booktitle={Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on},
title={Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back},
year={2013},
pages={253-262},
keywords={convex programming;directed graphs;network theory (graphs);central path navigation;convex optimization;directed graphs;electrical flows;interior-point methods;maximum-cardinality bipartite matching problem;sparse-graph case;unit capacities;Approximation algorithms;Context;Electric potential;Erbium;Laplace equations;Linear systems;Vectors;Laplacian linear systems;bipartite matchings;central path;electrical flows;interior-point methods;maximum flow problem;minimum s-t cut problem},
doi={10.1109/FOCS.2013.35},
ISSN={0272-5428},
month={Oct},}
@INPROCEEDINGS{LeeS14,
author={Yin Tat Lee and Sidford, A.},
booktitle={Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on},
title={Path Finding Methods for Linear Programming: Solving Linear Programs in $\tilde{O}(\sqrt{\textrm{rank}})$ Iterations and Faster Algorithms for Maximum Flow},
year={2014},
pages={424-433},
keywords={computational complexity;directed graphs;linear programming;linear systems;matrix algebra;bit complexity;constraint matrix;dense directed unit capacity graphs;linear program formulation;linear systems;linear time computation;path-finding methods;polynomial time;Approximation methods;Convergence;Laplace equations;Linear programming;Linear systems;Polynomials;Standards;interior point;linear program;maximum flow},
doi={10.1109/FOCS.2014.52},
ISSN={0272-5428},
month={Oct},}
@INPROCEEDINGS{KyngS16,
author={R. Kyng and S. Sachdeva},
booktitle={2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)},
title={Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple},
year={2016},
pages={573-582},
ISSN={0272-5428},
month={Oct},}
@inproceedings{KyngPPS17,
author = {Kyng, Rasmus and Pachocki, Jakub and Peng, Richard and Sachdeva, Sushant},
title = {A Framework for Analyzing Resparsification Algorithms},
booktitle = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms},
series = {SODA '17},
year = {2017},
pages = {2032--2043},
numpages = {12},
url = {http://dl.acm.org/citation.cfm?id=3039686.3039818},
acmid = {3039818},
publisher = {SIAM},
}
@article{DurfeePPR17,
author = {David Durfee and
John Peebles and
Richard Peng and
Anup B. Rao},
title = {Determinant-Preserving Sparsification of {SDDM} Matrices with Applications
to Counting and Sampling Spanning Trees},
journal = {CoRR},
volume = {abs/1705.00985},
year = {2017},
url = {http://arxiv.org/abs/1705.00985},
timestamp = {Wed, 07 Jun 2017 14:40:32 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/DurfeePPR17},
bibsource = {dblp computer science bibliography, http://dblp.org},
note = {To appear at FOCS 2017},
}
@article{JindalKPS17,
author = {Gorav Jindal and
Pavel Kolev and
Richard Peng and
Saurabh Sawlani},
title = {Density Independent Algorithms for Sparsifying k-Step Random Walks},
journal = {CoRR},
volume = {abs/1702.06110},
year = {2017},
url = {http://arxiv.org/abs/1702.06110},
timestamp = {Wed, 07 Jun 2017 14:41:20 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/JindalKPS17},
bibsource = {dblp computer science bibliography, http://dblp.org},
note = {To appear at APPROX 2017}
}
@inproceedings{DurfeeKPRS17,
author = {Durfee, David and Kyng, Rasmus and Peebles, John and Rao, Anup B. and Sachdeva, Sushant},
title = {Sampling Random Spanning Trees Faster Than Matrix Multiplication},
booktitle = {Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing},
series = {STOC 2017},
year = {2017},
isbn = {978-1-4503-4528-6},
pages = {730--742},
numpages = {13},
url = {http://doi.acm.org/10.1145/3055399.3055499},
doi = {10.1145/3055399.3055499},
acmid = {3055499},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Approximate Schur Complement, Graph Sparsification, Random Spanning Trees, Sampling Algorithm},
}
@inproceedings{SchildRS17,
author = {Schild, Aaron and Rao, Satish and Srivastava, Nikhil},
title = {Localization of Electrical Flows},
booktitle = {Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms},
series = {SODA '18},
year = {2018},
isbn = {978-1-6119-7503-1},
location = {New Orleans, Louisiana},
pages = {1577--1584},
numpages = {8},
url = {http://dl.acm.org/citation.cfm?id=3174304.3175408},
acmid = {3175408},
publisher = {Society for Industrial and Applied Mathematics},
address = {Philadelphia, PA, USA},
}
@article {SingerW12,
author = {Singer, A. and Wu, H.-T.},
title = {Vector diffusion maps and the connection Laplacian},
journal = {Communications on Pure and Applied Mathematics},
volume = {65},
number = {8},
publisher = {Wiley Subscription Services, Inc., A Wiley Company},
issn = {1097-0312},
url = {http://dx.doi.org/10.1002/cpa.21395},
doi = {10.1002/cpa.21395},
pages = {1067--1144},
year = {2012},
}
@article{BandeiraSS13,
author = {Afonso S. Bandeira and Amit Singer and Daniel A. Spielman},
title = {A Cheeger Inequality for the Graph Connection Laplacian},
journal = {SIAM Journal on Matrix Analysis and Applications},
volume = {34},
number = {4},
pages = {1611-1630},
year = {2013},
}
@article{AndersenCL06,
author = {Reid Andersen and