Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Marathe, M.V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Upgrading bottleneck constrained forests
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
S.S. Ravi
,
H.-C. Wirth
Discrete Applied Mathematics
108
(1-2), 2001, pp. 129-142
Approximation algorithms for degree-constrained minimum-cost network-design problems
R. Ravi
,
M.V. Marathe
,
S.S. Ravi
,
D.J. Rosenkrantz
,
H.B. Hunt III
Algorithmica
31
(1), 2001, pp. 58-78
Improving minimum cost spanning trees by upgrading nodes
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
R. Ravi
,
S.S. Ravi
,
S. Sundaram
,
H.-C. Wirth
Journal of Algorithms
33
(1), 1999, pp. 92-111
Upgrading bottleneck constrained forests
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
S.S. Ravi
,
H.-C. Wirth
Lecture Notes in Computer Science
1517
, 1998, pp. 215-226
Compact location problems
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
V. Radhakrishnan
,
S.S. Ravi
,
D.J. Rosenkrantz
Theoretical Computer Science
181
(2), 1997, pp. 379-404
Improving spanning trees by upgrading nodes
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
R. Ravi
,
S.S. Ravi
,
R. Sundaram
,
H.C. Wirth
Lecture Notes in Computer Science
1256
, 1997, pp. 281-291
Modifying networks to obtain low cost trees
S.O. Krumke
,
H. Noltemeier
,
M.V. Marathe
,
S.S. Ravi
,
K.U. Drangmeister
Lecture Notes in Computer Science
1197
, 1997, pp. 293-307
Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
M.V. Marathe
,
H.B. Hunt III
,
S.S. Ravi
Discrete Applied Mathematics
64
, 1996, pp. 135-149
On approximation algorithms for the minimum satisfiability problem
M.V. Marathe
,
S.S. Ravi
Information Processing Letters
58
(1), 1996, pp. 23-29
Spanning trees-Short or small
R. Ravi
,
R. Sundaram
,
M.V. Marathe
,
D.J. Rosenkrantz
,
S.S. Ravi
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 178-200
Compact location problems with budget and communication constraints
S.O. Krumke
,
H. Noltemeier
,
S.S. Ravi
,
M.V. Marathe
Lecture Notes in Computer Science
959
, 1995, pp. 510-519
Complexity and approximability of certain bicriteria location problems
S.O. Krumke
,
H. Noltemeier
,
S.S. Ravi
,
M.V. Marathe
Lecture Notes in Computer Science
1017
, 1995, pp. 73-87
Simple heuristics for unit disk graphs
M.V. Marathe
,
H. Breu
,
H.B. Hunt III
,
S.S. Ravi
,
D.J. Rosenkrantz
Networks
25
(1), 1995, pp. 59-68
Bicriteria network design problems
M.V. Marathe
,
R. Ravi
,
R. Sundaram
,
S.S. Ravi
,
D.J. Rosenkrantz
,
H.B. Hunt III
Lecture Notes in Computer Science
944
, 1995, pp. 487-498
A unified approach to approximation schemes for NP- and PSPACE-hard problems for geometric graphs
H.B. Hunt III
,
M.V. Marathe
,
V. Radhakrishnan
,
S.S. Ravi
,
D.J. Rosenkrantz
,
R.E. Stearns
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 424-435
Approximation schemes using
L
-reductions
^{1,2,3}
H.B. Hunt III
,
M.V. Marathe
,
V. Radhakrishnan
,
S.S. Ravi
,
D.J. Rosenkrantz
,
R.E. Stearns
Lecture Notes in Computer Science
880
, 1994, pp. 342-353
Generalized CNF satisfiability problems and non-efficient approximability
H.B. Hunt
,
M.V. Marathe
,
R.E. Stearns
Proceedings of the Ninth Annual Conference on Structure in Complexity Theory (Amsterdam, The Netherlands, June 28 - July 1, 1994)
, 1994, pp. 356-366
Approximation schemes for PSPACE-complete problems for succint specifications
M.V. Marathe
,
H.B. Hunt III
,
R.E. Stearns
,
V. Radhakrishnan
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 468-477
Spanning trees short or small
R. Ravi
,
R. Sundaram
,
M.V. Marathe
,
D.J. Rosenkrantz
,
S.S. Ravi
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 546-555
The complexity of approximating PSPACE-complete problems for hierarchical specifications
M.V. Marathe
,
H.B. Hunt III
,
S.S. Ravi
Lecture Notes in Computer Science
700
, 1993, pp. 76-87
Hierarchically specified unit disk graphs
M.V. Marathe
,
V. Radhakrishnan
,
H.B. Hunt III
,
S.S. Ravi
Lecture Notes in Computer Science
790
, 1993, pp. 21-32
Many birds with one stone: Multi-objective approximation algorithms (extended abstract)
R. Ravi
,
M.V. Marathe
,
S.S. Ravi
,
D.J. Rosenkrantz
,
H.B. Hunt III
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 438-447